Data Correcting Approaches in Combinatorial 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...

Full description

Bibliographic Details
Main Authors: Goldengorin, Boris I., Pardalos, Panos M. (Author)
Format: eBook
Language:English
Published: New York, NY Springer New York 2012, 2012
Edition:1st ed. 2012
Series:SpringerBriefs in Optimization
Subjects:
Online Access:
Collection: Springer eBooks 2005- - Collection details see MPG.ReNa
LEADER 02336nmm a2200337 u 4500
001 EB000364837
003 EBX01000000000000000217889
005 00000000000000.0
007 cr|||||||||||||||||||||
008 130626 ||| eng
020 |a 9781461452867 
100 1 |a Goldengorin, Boris I. 
245 0 0 |a Data Correcting Approaches in Combinatorial Optimization  |h Elektronische Ressource  |c by Boris I. Goldengorin, Panos M. Pardalos 
250 |a 1st ed. 2012 
260 |a New York, NY  |b Springer New York  |c 2012, 2012 
300 |a X, 114 p. 41 illus  |b online resource 
653 |a Artificial intelligence / Data processing 
653 |a Optimization 
653 |a Algorithms 
653 |a Graph Theory 
653 |a Graph theory 
653 |a Mathematical optimization 
653 |a Data Science 
700 1 |a Pardalos, Panos M.  |e [author] 
041 0 7 |a eng  |2 ISO 639-2 
989 |b Springer  |a Springer eBooks 2005- 
490 0 |a SpringerBriefs in Optimization 
028 5 0 |a 10.1007/978-1-4614-5286-7 
856 4 0 |u https://doi.org/10.1007/978-1-4614-5286-7?nosfx=y  |x Verlag  |3 Volltext 
082 0 |a 511.5 
520 |a 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