An analysis of several heuristics for the traveling salesman problem

Fundamental Problems in Computing: Essays in Honor of Professor Daniel J. Rosenkrantz

Volumn , Issue , 2009, Pages 45-69

  Rosenkrantz, Daniel J ^a   Stearns, Richard E ^a   Lewis II, Philip M ^a  

^a GE GLOBAL RESEARCH   (United States)

Author keywords

approximation algorithm; k optimal; minimal spanning tree; traveling salesman problem; triangle inequality

Indexed keywords

EID: 80052974072     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/978-1-4020-9688-4_3     Document Type: Chapter

References (16)

1. M. Bellmore and G. L. Nemhauser. The traveling salesman problem: A survey. Operations Res., 16:538-558, 1968.
2. N. Christofides. Worst-case analysis of a new heuristic for the traveling salesman problem. In Symp. on New Directions and Recent Results in Algorithms and Complexity. Carnegie-Mellon Univ., Pittsburgh, 1976.
3. G. A. Croes. A method for solving traveling salesman problems. Operations Res., 6:791-812, 1958.
4. R. Floyd. Algorithm 97, Shortest path. Comm. ACM, 5:345, 1962.
5. J. Gavett. Three heuristic rules for sequencing jobs to a single production facility. Management Sci., 11:166-176, 1965.
6. W. W. Hardgrave and G. L. Nemhauser. On the relation between the traveling salesman and the longest path problem. Operations Res., 10:647-657, 1962.
7. L. L. Karg and G. L. Thompson. A heuristic approach to solving traveling salesman problems. Management Sci., 10:225-248, 1964.
8. R. M. Karp. Reducibility among combinatorial problems. In R. E. Miller and J. W. Thatcher, editors, Complexity of Computer Computations, pages 85-103. Plenum, New York, 1972.
9. J. B. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. Amer. Math. Soc., 2:48-50, 1956.
10. S. Lin. Computer solution of the traveling salesman problem. Bell System Te c h. J., 44:2245-2269, 1965.
11. S. Lin and B. W. Kernighan. An effective heuristic algorithm for the traveling salesman problem. Operations Res., 21:498-516, 1973.
12. T. A. J. Nicholson. A sequential method for discrete optimization problems and its application to the assignment, traveling salesman, and three machine scheduling problems. J. Inst. Math. Appl., 3:362-375, 1967.
13. R. C. Prim. Shortest connection networks and some generalizations. Bell System Tech. J., 36:1389-1401, 1957.
14. S. Reiter and G. Sherman. Discrete optimizing. J. Soc. Indust. Appl. Math., 13:864-889, 1965.
15. S. M. Roberts and B. Flores. An engineering approach to the traveling salesman problem. Management Sci., 13:269-288, 1966.
16. S. Sahni and T. Gonzales. P-complete problems and approximate solutions. In IEEE Fifteenth Ann. Symp. on Switching and Automata Theory, pages 28-32, 1974.