The Traveling Salesman Problem: A Survey
作者： M. Bellmore , G. L. Nemhauser
DOI: 10.1007/978-3-642-51565-1_136
关键词:
摘要: A survey and synthesis of research on the traveling salesman problem is given. The defined several theorems are presented. This followed by a general classification solution techniques description some proven methods. summary computational results
springer.com
sci-hub.st 参考文章(6)
S. M. Roberts, Benito Flores, An Engineering Approach to the Traveling Salesman Problem Management Science. ,vol. 13, pp. 269- 288 ,(1966) , 10.1287/MNSC.13.3.269
Ralph E. Gomory, Outline of an algorithm for integer solutions to linear programs Bulletin of the American Mathematical Society. ,vol. 64, pp. 275- 278 ,(1958) , 10.1090/S0002-9904-1958-10224-4
P. C. Gilmore, R. E. Gomory, Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem Operations Research. ,vol. 12, pp. 655- 679 ,(1964) , 10.1287/OPRE.12.5.655
Eugene L. Lawler, The Quadratic Assignment Problem Management Science. ,vol. 9, pp. 586- 599 ,(1963) , 10.1287/MNSC.9.4.586
G. B. Dantzig, D. R. Fulkerson, S. M. Johnson, On a Linear-Programming, Combinatorial Approach to the Traveling-Salesman Problem Operations Research. ,vol. 7, pp. 58- 66 ,(1959) , 10.1287/OPRE.7.1.58
G. A. Croes, A Method for Solving Traveling-Salesman Problems Operations Research. ,vol. 6, pp. 791- 812 ,(1958) , 10.1287/OPRE.6.6.791