Data Correcting Algorithms In Combinatorial Optimization paperback english - #N/A
Now:
AED 210.20 Inclusive of VAT
Get it by 29 Dec
Pay 4 interest-free payments of AED 52.55.Learn more
Split in 4 payments of AED 52.55. No interest. No late fees.Learn more
1
Free delivery on Lockers & Pickup Points
Learn more
Enjoy hassle free returns with this offer.
Item as Described
50%
Partner Since
2+ YearsSpecifications
| Publisher | Springer-Verlag New York Inc. |
| ISBN 13 | 9781461452850 |
| Book Description | 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. |
| Language | English |
| Author | Boris I. Goldengorin, Panos M. Pardalos |
| Edition Number | 3 |
| Publication Date | #N/A |
| Number of Pages | 114 |
Data Correcting Algorithms In Combinatorial Optimization paperback english - #N/A
Added to cart
Cart Total AED 210.20
