Check nearby libraries
Buy this book
![Loading indicator](/images/ajax-loader-bar.gif)
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 world problems.
Check nearby libraries
Buy this book
![Loading indicator](/images/ajax-loader-bar.gif)
Previews available in: English
Showing 1 featured edition. View all 1 editions?
Edition | Availability |
---|---|
1
Data Correcting Approaches in Combinatorial Optimization
2012, Springer New York, Imprint: Springer
electronic resource /
in English
1461452864 9781461452867
|
aaaa
Libraries near you:
WorldCat
|
Book Details
Edition Notes
Classifications
The Physical Object
ID Numbers
Community Reviews (0)
Feedback?November 13, 2020 | Edited by MARC Bot | import existing book |
June 29, 2019 | Created by MARC Bot | import new book |