The Traveling Salesman Problem and Its Variations (Combinatorial Optimization)
Bei weiteren Verkäufern erhältlichAlle Exemplare dieses Buches anzeigen
Brand New, Unread Copy in Perfect Condition. A+ Customer Service! Summary: Preface. Contributing Authors. 1. The Traveling Salesman Problem: Applications, Formulations and Variations; A.P. Punnen. 2. Polyhedral Theory and Branch-and-Cut Algorithms for the Symmetric TSP; D. Naddef. 3. Polyhedral Theory for the Asymmetric Traveling Salesman Problem; E. Balas, M. Fischetti. 4. Exact Methods for the Asymmetric Traveling Salesman Problem M. Fischetti, et al. 5. Approximation Algorithms for Geometric TSP; S. Arora. 6. Exponential Neighborhoods and Domination Analysis for the TSP; G. Gutin, et al. 7. Probabilistic Analysis of the TSP; A.M. Frieze, J.E. Yukich. 8. Local Search and Metaheuristics; C. Rego, F. Glover. 9. Experimental Analysis of Heuristics for the STSP; D.S. Johnson, L.A. McGeoch. 10. Experimental Analysis of Heuristics for the ATSP; D.S. Johnson, et al. 11. Polynomially Solvable Cases of the TSP; S.N. Kabadi. 12. The Maximum TSP; A. Barvinok, et al. 13. The Generalized Traveling Salesman and Orienteering Problems; M. Fischetti, et al. 14. The Prize Collecting Traveling Salesman Problem and Its Applications; E. Balas. 15. The Bottleneck TSP; S.N. Kabadi, A.P. Punnen. 16. TSP Software; A. Lodi, A.P. Punnen. Appendix A: Sets, Graphs and Permutations. Appendix B: Computational Complexity. References. List of Figures. List of Tables. Index. Buchnummer des Verkäufers ABE_book_new_1402006640
Über diesen Titel:
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.
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.
Titel: The Traveling Salesman Problem and Its ...
Zahlungsarten, die dieser Verkäufer akzeptiert
Lewiston, NY, USA
AbeBooks Verkäufer seit 7. Mai 2014
We guarantee the condition of every book as it's described on the AbeBooks web
sites. If you're dissatisfied with your purchase (Incorrect Book/Not as
Described/Damaged) or if the order hasn't arrived, you're eligible for a refund
within 30 days of the estimated delivery date. If you've changed your mind
about a book that you've ordered, please use the Ask bookseller a question link
to contact us and we'll respond within 2 business days.
Shipping costs are based on books weighing 2.2 LB, or 1 KG. If your book order is heavy or oversized, we may contact you to let you know extra shipping is required.