New results on the old k-opt algorithm for the traveling salesman problem

SIAM Journal on Computing

Volumn 28, Issue 6, 1999, Pages 1998-2029

  Chandra, Barun ^a   Karloff, Howard ^b   Tovey, Craig ^c  

^a UNIVERSITY OF NEW HAVEN   (United States)

^b Georgia Institute of Technology   (United States)

^c Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPH THEORY; HEURISTIC METHODS; PROBABILISTIC LOGICS;

COMPUTER SCIENCE HEADING; OPTIMIZATION HEADING;

TRAVELING SALESMAN PROBLEM;

EID: 0033323760     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539793251244     Document Type: Article

References (17)

1. N. ALON AND Y. AZAR. On-line Steiner trees in the Euclidean plane, in Proc. 8th ACM Symposium on Computational Geometry, Berlin, 1992, pp. 337-343.
2. J. L. BENTLEY, Invited talk at the 1st SIAM Symposium on Discrete Algorithms, San Francisco, 1990.
3. J. L. BENTLEY AND J. SAXE, An analysis of two heuristics for the Euclidean traveling salesman problem, in Proc. 18th Allerton Conference on Communication, Control and Computing. Urbana-Champaign, IL, 1980, pp. 41-49.
4. B. BOLLOBÁS, Extremal Graph Theory. Academic Press, London, 1978.
5. B. CHANDRA, G. DAS, G. NARASIMHAN, AND J. SOARES, New sparseness results on graph spanners, in Proc. 8th ACM Symposium on Computational Geometry, Berlin, 1992, pp. 192-201.
6. L. K. GROVER, Local search and the local structure of NP-complete problems, Oper. Res. Lett., 12 (1992), pp. 235-243.
7. D. J. JOHNSON, C. H. PAPADIMITRIOU, AND M. YANNAKAKIS, How easy is local search?, J. Comput. System Sci., 37 (1988), pp. 79-100.
8. R. M. KARP AND J. M. STEELE, Probabilistic analysis of heuristics, in The Traveling Salesman Problem, E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, and D. B. Shmoys, eds., John Wiley and Sons, New York, 1985, pp. 181-205.
9. W. KERN, A probabilistic analysis of the switching algorithm for the Euclidean TSP. Math. Programming, 44 (1989), pp. 213-219.
10. M. W. KRENTEL, Structure in locally optimal solutions, in Proc. 30th Symposium on Foundations of Computer Science, Research Triangle Park, NC, 1989, pp. 216-221.
11. M. W. KRENTEL, personal communication, Rice University, Houston, TX.
12. E. L. LAWLER, J. K. LENSTRA, A. H. G. RINNOOY KAN, AND D. B. SHMOYS, EDS., The Traveling Salesman Problem, John Wiley and Sons, New York, 1985.
13. S. LIN AND B. W. KERNIGHAN, An effective heuristic for the traveling salesman problem, Oper. Res., 21 (1973), pp. 489-516.
14. L. LOOMIS AND S. STERNBERG, Advanced Calculus, Addison-Wesley, Reading, MA, 1968.
15. G. LUEKER, Unpublished manuscript, Princeton University, Princeton, NJ, 1975.
16. C. H. PAPADIMITRIOU AND K. STEIGLITZ, Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Englewood Cliffs, NJ, 1982.
17. C. A. ROGERS, Covering a sphere with, spheres, Mathematika, 10 (1963), pp. 157-164.