The Traveling Salesman Problem and Its Variations
(Sprache: Englisch)
A brilliant treatment of a knotty problem in computing. This volume contains chapters written by reputable researchers and provides the state of the art in theory and algorithms for the traveling salesman problem (TSP). The book covers all important areas...
Leider schon ausverkauft
versandkostenfrei
Buch
320.99 €
160 DeutschlandCard Punkte
sammeln
- Lastschrift, Kreditkarte, Paypal, Rechnung
- Kostenlose Rücksendung
- Ratenzahlung möglich
Produktdetails
Produktinformationen zu „The Traveling Salesman Problem and Its Variations “
Klappentext zu „The Traveling Salesman Problem and Its Variations “
A brilliant treatment of a knotty problem in computing. This volume contains chapters written by reputable researchers and provides the state of the art in theory and algorithms for the traveling salesman problem (TSP). The book covers all important areas of study on TSP, including polyhedral theory for symmetric and asymmetric TSP, branch and bound, and branch and cut algorithms, probabilistic aspects of TSP, and includes a thorough computational analysis of heuristic and metaheuristic algorithms.
This volume, which contains chapters written by reputable researchers, provides the state of the art in theory and algorithms for the traveling salesman problem (TSP). The book covers all important areas of study on TSP, including polyhedral theory for symmetric and asymmetric TSP, branch and bound, and branch and cut algorithms, probabilistic aspects of TSP, thorough computational analysis of heuristic and metaheuristic algorithms, theoretical analysis of approximation algorithms, including the emerging area of domination analysis of algorithms, discussion of TSP software and variations of TSP such as bottleneck TSP, generalized TSP, prize collecting TSP, maximizing TSP, orienteering problem, etc.
Audience
This book is intended for researchers, practitioners, and academicians in mathematics, computer science, and operations research. It is appropriate as a reference work or as a main or supplemental textbook in graduate and senior undergraduate courses and projects.
Audience
This book is intended for researchers, practitioners, and academicians in mathematics, computer science, and operations research. It is appropriate as a reference work or as a main or supplemental textbook in graduate and senior undergraduate courses and projects.
Inhaltsverzeichnis zu „The Traveling Salesman Problem and Its Variations “
Preface. Contributing Authors.- 1. The Traveling Salesman Problem: Applications, Formulations and Variations.- 2. Polyhedral Theory and Branch-and-Cut Algorithms for the Symmetric TSP.- 3. Polyhedral Theory for the Asymmetric Traveling Salesman Problem.- 4. Exact Methods for the Asymmetric Traveling Salesman Problem.- 5. Approximation Algorithms for Geometric TSP.- 6. Exponential Neighborhoods and Domination Analysis for the TSP.- 7. Probabilistic Analysis of the TSP.- 8. Local Search and Metaheuristics.- 9. Experimental Analysis of Heuristics for the STSP.- 10. Experimental Analysis of Heuristics for the ATSP.- 11. Polynomially Solvable Cases of the TSP.- 12. The Maximum TSP.- 13. The Generalized Traveling Salesman and Orienteering Problems.- 14. The Prize Collecting Traveling Salesman Problem and Its Applications.- 15. The Bottleneck TSP.- 16. TSP Software.- Appendix A: Sets, Graphs and Permutations. Appendix B: Computational Complexity. References. List of Figures. List of Tables. Index.Bibliographische Angaben
- 2002, 2002, 830 Seiten, Maße: 16 x 24,1 cm, Gebunden, Englisch
- Herausgegeben:Gutin, G.; Punnen, A.P.
- Herausgegeben: A. P. Punnen, G. Gutin
- Verlag: Springer Netherlands
- ISBN-10: 1402006640
- ISBN-13: 9781402006647
- Erscheinungsdatum: 31.05.2002
Sprache:
Englisch
Kommentar zu "The Traveling Salesman Problem and Its Variations"
0 Gebrauchte Artikel zu „The Traveling Salesman Problem and Its Variations“
| Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
|---|
Schreiben Sie einen Kommentar zu "The Traveling Salesman Problem and Its Variations".
Kommentar verfassen