The traveling salesman problem and its variations

作者:

DOI: 10.1007/B101971

关键词:

摘要: 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.

参考文章(22)
Gregory Gutin, Alexei Zverovitch, Evaluation of The Contract Or-Patch Heuristic Eor The Asymmetric Tsp1 Infor. ,vol. 43, pp. 23- 31 ,(2005) , 10.1080/03155986.2005.11732712
John W. Moon, Topics on tournaments ,(1968)
Gregory Z. Gutin, Jrgen Bang-Jensen, Digraphs: Theory, Algorithms and Applications ,(2002)
Claude Berge, Alison Doig, The theory of graphs ,(1962)
Roland Häggkvist, Tristan M. J. Denley, Armen S. Asratian, Bipartite graphs and their applications ,(1998)
Punnen, Margot, Kabadi, TSP Heuristics: Domination Analysis and Complexity Algorithmica. ,vol. 35, pp. 111- 127 ,(2003) , 10.1007/S00453-002-0986-1
Jill Cirasella, David S. Johnson, Lyle A. McGeoch, Weixiong Zhang, The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests algorithm engineering and experimentation. pp. 32- 59 ,(2001) , 10.1007/3-540-44808-X_3
Egon Balas, Neil Simonetti, Linear Time Dynamic-Programming Algorithms for New Classes of Restricted TSPs: A Computational Study Informs Journal on Computing. ,vol. 13, pp. 56- 75 ,(2000) , 10.1287/IJOC.13.1.56.9748
Michael Held, Richard M. Karp, A Dynamic Programming Approach to Sequencing Problems Journal of The Society for Industrial and Applied Mathematics. ,vol. 10, pp. 196- 210 ,(1962) , 10.1137/0110015