书目名称 | Data Correcting Approaches in Combinatorial Optimization |
编辑 | Boris Goldengorin,Panos M. Pardalos |
视频video | |
概述 | Focuses on algorithmic applications of well known polynomially solvable special cases of computationally intractable problems.Discusses design of practically efficient algorithms for solving wide clas |
丛书名称 | SpringerBriefs in Optimization |
图书封面 |  |
描述 | .Data Correcting Approaches in Combinatorial Optimization. focuses on algorithmic applications of the well known polynomially solvable special cases of computationally intractable problems. The purpose of this text is to design practically efficient algorithms for solving wide classes of combinatorial optimization problems. Researches, students and engineers will benefit from new bounds and branching rules in development efficient branch-and-bound type computational algorithms. This book examines applications for solving the Traveling Salesman Problem and its variations, Maximum Weight Independent Set Problem, Different Classes of Allocation and Cluster Analysis as well as some classes of Scheduling Problems. Data Correcting Algorithms in Combinatorial Optimization introduces the data correcting approach to algorithms which provide an answer to the following questions: how to construct a bound to the original intractable problem and find which element of the corrected instance one should branch such that the total size of search tree will be minimized. The PC time needed for solving intractable problems will be adjusted with the requirements for solving real wo |
出版日期 | Book 2012 |
关键词 | algorithmics; cluster analysis; combinatorial optimization; data correcting algorithms; data structures; |
版次 | 1 |
doi | https://doi.org/10.1007/978-1-4614-5286-7 |
isbn_softcover | 978-1-4614-5285-0 |
isbn_ebook | 978-1-4614-5286-7Series ISSN 2190-8354 Series E-ISSN 2191-575X |
issn_series | 2190-8354 |
copyright | Boris Goldengorin, Panos M. Pardalos 2012 |