An analysis of several heuristics for the traveling salesman problem
暂无分享,去创建一个
[1] J. William Gavett,et al. Three Heuristic Rules for Sequencing Jobs to a Single Production Facility , 1965 .
[2] R. Prim. Shortest connection networks and some generalizations , 1957 .
[3] Teofilo F. Gonzalez,et al. P-Complete Problems and Approximate Solutions , 1974, SWAT.
[4] T. A. J. Nicholson,et al. A Sequential Method for Discrete Optimization Problems and its Application to the Assignment, Travelling Salesman, and Three Machine Scheduling Problems , 1967 .
[5] G. Croes. A Method for Solving Traveling-Salesman Problems , 1958 .
[6] Brian W. Kernighan,et al. An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..
[7] Richard M. Karp,et al. Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.
[8] Shen Lin. Computer solutions of the traveling salesman problem , 1965 .
[9] George L. Nemhauser,et al. The Traveling Salesman Problem: A Survey , 1968, Oper. Res..
[10] S. M. Roberts,et al. An Engineering Approach to the Traveling Salesman Problem , 1966 .
[11] J. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .
[12] G. L. Thompson,et al. A Heuristic Approach to Solving Travelling Salesman Problems , 1964 .
[13] W. W. Hardgrave,et al. On the Relation Between the Traveling-Salesman and the Longest-Path Problems , 1962 .