Books > Science & Mathematics > Mathematics > Combinatorics & graph theory
|
Buy Now
Data Correcting Approaches in Combinatorial Optimization (Paperback, 2012 ed.)
Loot Price: R1,428
Discovery Miles 14 280
|
|
Data Correcting Approaches in Combinatorial Optimization (Paperback, 2012 ed.)
Series: SpringerBriefs in Optimization
Expected to ship within 10 - 15 working days
|
"Data Correcting Approaches in Combinatorial Optimization" focuses
on algorithmic applications of thewell 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 findwhich 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. "
General
Is the information for this product incomplete, wrong or inappropriate?
Let us know about it.
Does this product have an incorrect or missing image?
Send us a new image.
Is this product missing categories?
Add more categories.
Review This Product
No reviews yet - be the first to create one!
|
|
Email address subscribed successfully.
A activation email has been sent to you.
Please click the link in that email to activate your subscription.