Carte Data Correcting Approaches in Combinatorial Optimization Boris Goldengorin

Data Correcting Approaches in Combinatorial Optimization

Limbă: engleză
Legare: Carte broșată
Editura: Springer, Berlin
Disponibilitate: În depozitul extern
Expediem în 5-8 zile
277.18 lei
Data Correcting Approaches in Combinatorial Optimization focuses on algorithmic applications of the...

Informații despre carte

Limbă
engleză
Legare
Carte - Carte broșată
Publicat
2012
Pagini
114
EAN
9781461452850
ISBN
1461452856
Enbook ID
01428245
Greutate
188
Dimensiuni
156 x 236 x 6

Descriere completă

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.

S-ar putea să te intereseze

144.50 lei
670.77 lei

Nile River Basin

Assefa Melesse
1 104.81 lei

Clienții care au cumpărat această carte au mai cumpărat și