An Effective Heuristic Algorithm for the Traveling-Salesman Problem
暂无分享,去创建一个
[1] George L. Nemhauser,et al. The Traveling Salesman Problem: A Survey , 1968, Oper. Res..
[2] Richard M. Karp,et al. The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..
[3] George B. Dantzig,et al. Solution of a Large-Scale Traveling-Salesman Problem , 1954, Oper. Res..
[4] G. Croes. A Method for Solving Traveling-Salesman Problems , 1958 .
[5] G. L. Thompson,et al. A Heuristic Approach to Solving Travelling Salesman Problems , 1964 .
[6] K. Steiglitz,et al. The Design of Minimum-Cost Survivable Networks , 1969 .
[7] Patrick D. Krolak,et al. A man-machine approach toward solving the traveling salesman problem , 1970, DAC '70.
[8] Brian W. Kernighan,et al. An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..
[9] M. Held,et al. A dynamic programming approach to sequencing problems , 1962, ACM National Meeting.
[10] M. Held,et al. A dynamic programming approach to sequencing problems , 1962, ACM National Meeting.
[11] Martin J. Krone,et al. Heuristic programming applied to scheduling problems , 1971 .
[12] Shen Lin. Computer solutions of the traveling salesman problem , 1965 .