Calculus of Tolerances in Combinatorial Optimization
Theory and Algorithms
Series: Springer Optimization and Its Applications; 113;
- Publisher's listprice EUR 117.69
-
49 924 Ft (47 546 Ft + 5% VAT)
The price is estimated because at the time of ordering we do not know what conversion rates will apply to HUF / product currency when the book arrives. In case HUF is weaker, the price increases slightly, in case HUF is stronger, the price goes lower slightly.
- Discount 8% (cc. 3 994 Ft off)
- Discounted price 45 929 Ft (43 742 Ft + 5% VAT)
49 924 Ft
Availability
Uncertain availability. Please turn to our customer service.
Why don't you give exact delivery time?
Delivery time is estimated on our previous experiences. We give estimations only, because we order from outside Hungary, and the delivery time mainly depends on how quickly the publisher supplies the book. Faster or slower deliveries both happen, but we do our best to supply as quickly as possible.
Product details:
- Edition number 1st ed. 2016
- Publisher Springer, Berlin
- Date of Publication 1 January 2016
- Number of Volumes 1 pieces Book
- ISBN 9781493940066
- Binding Hardback
- No. of pages370 pages
- Size 235x155 mm
- Language English
- Illustrations 40 SW-Abb., 35 Farbabb. 0
Categories
Short description:
XYZ
MoreLong description:
This book focuses on the theory of calculus of tolerances and its applications to heuristics and exact algorithms for combinatorial optimization problems (COPs). A tolerance is the maximum perturbation of a single element value within an optimal solution while all other input data is unchanged. This exposition specifically discusses tolerances for describing the structure and relationships among optimal solutions to combinatorial optimization problems. Applications of tolerances for solving the symmetric, asymmetric, second order traveling salesman problems, maximum weight independent set problem, and different classes of vehicle routing problems are discussed in detail. Numerous insightful examples and remarks help the reader master theoretical results and understand the framework of tolerance based algorithms and underlying concepts.
Aimed toward designers of efficient algorithms, this book would benefit graduate students, researchers and engineers in operations research, computer science, applied mathematics, bioinformatics, artificial intelligence, and machine learning.
Table of Contents:
1.Introduction.
- 2. Notations and Definitions.
- 3. The Theory of Tolerances.
- 4. Heuristics for the Asymmetric Traveling Salesman Problem.
- 5. Heuristics for the Symmetric Traveling Salesman Problem.
- 6. Heuristics and Exact Algorithms for the Traveling Salesman Problem of Second Order.
- 7. Tolerance Based Branch and Bound for the Asymmetric Traveling Salesman Problem.
- 8. The Performance of Branch and Bound for the Asymmetric Traveling Salesman Problem.
- 9. Tolerance Based Branch and Bound Algorithms for Asymmetric Vehicle Routing Problems.
- 10. The computation of large sets of upper and lower tolerances.
- 11. Global Tolerances in Combinatorial Optimization.
- Index.
