Calculus of Tolerances in Combinatorial Optimization
Theory and Algorithms
Seiten
2016
|
2016 ed.
Springer-Verlag New York Inc.
978-1-4939-4006-6 (ISBN)
Springer-Verlag New York Inc.
978-1-4939-4006-6 (ISBN)
- Titel wird leider nicht erscheinen
- Artikel merken
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.
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.
Erscheint lt. Verlag | 5.9.2016 |
---|---|
Reihe/Serie | Springer Optimization and Its Applications ; .113 |
Zusatzinfo | 40 black & white illustrations, 35 colour illustrations, biography |
Verlagsort | New York |
Sprache | englisch |
Maße | 155 x 235 mm |
Themenwelt | Mathematik / Informatik ► Mathematik ► Analysis |
Mathematik / Informatik ► Mathematik ► Angewandte Mathematik | |
Mathematik / Informatik ► Mathematik ► Finanz- / Wirtschaftsmathematik | |
Mathematik / Informatik ► Mathematik ► Graphentheorie | |
Schlagworte | combinatorial optimization • Combinatorial Optimization Problem • exact algorithms • graph theory • Hamiltonian cycle • Heuristics • Minimum Spanning Tree Problem • Nearest Neighbor Patching Heuristic • Permuted Markov model • Search Theory • Symmetric Traveling Salesman Problem • tolerance calculus • Upper Tolerances |
ISBN-10 | 1-4939-4006-6 / 1493940066 |
ISBN-13 | 978-1-4939-4006-6 / 9781493940066 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
Buch | Softcover (2024)
De Gruyter Oldenbourg (Verlag)
CHF 83,90