Experiments on traveling salesman heuristics

作者: Jon Louis Bentley

DOI: 10.5555/320176.320186

关键词: Bottleneck traveling salesman problemLin–Kernighan heuristicHeuristics2-optCombinatorial optimizationChristofides algorithmMathematical optimizationTraveling purchaser problemTravelling salesman problemComputer science

摘要:

参考文章(4)
A.A. Schoone, J. van Leeuwen, Untangling a traveling salesman tour in the plane workshop on graph-theoretic concepts in computer science. pp. 87- 98 ,(1980)
Richard M. Karp, Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane Mathematics of Operations Research. ,vol. 2, pp. 209- 224 ,(1977) , 10.1287/MOOR.2.3.209
Shen Lin, Computer Solutions of the Traveling Salesman Problem Bell System Technical Journal. ,vol. 44, pp. 2245- 2269 ,(1965) , 10.1002/J.1538-7305.1965.TB04146.X
Jon Louis Bentley, K-d trees for semidynamic point sets symposium on computational geometry. pp. 187- 197 ,(1990) , 10.1145/98524.98564