摘要: Preface. Contributing Authors.- 1. The Traveling Salesman Problem: Applications, Formulations and Variations.- 2. Polyhedral Theory Branch-and-Cut Algorithms for the Symmetric TSP.- 3. Asymmetric Problem.- 4. Exact Methods 5. Approximation Geometric 6. Exponential Neighborhoods Domination Analysis 7. Probabilistic of 8. Local Search Metaheuristics.- 9. Experimental Heuristics STSP.- 10. ATSP.- 11. Polynomially Solvable Cases 12. Maximum 13. Generalized Orienteering Problems.- 14. Prize Collecting Problem Its Applications.- 15. Bottleneck 16. TSP Software.- Appendix A: Sets, Graphs Permutations. B: Computational Complexity. References. List Figures. Tables. Index.