Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.
You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.
After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.
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.
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.