Asymptotic experimental analysis for the Held-Karp traveling salesman bound

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn Part F129447, Issue , 1996, Pages 341-350

  Johnson, D S ^a   McGeoch, L A ^b   Rothberg, E E ^c  

^a LUCENT TECHNOLOGIES   (United States)

^b AMHERST COLLEGE   (United States)

^c HEWLETT PACKARD ENTERPRISE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; INTEGER PROGRAMMING; ITERATIVE METHODS; LINEAR PROGRAMMING; OPTIMIZATION;

EUCLIDEAN INSTANCES; EXPERIMENTAL ANALYSIS; INTEGER PROGRAMMING FORMULATIONS; LAGRANGEAN RELAXATION; LINEAR PROGRAMMING RELAXATION; RATE OF CONVERGENCE; SEPARATION ALGORITHMS; VARIANCE REDUCTIONS;

TRAVELING SALESMAN PROBLEM;

EID: 84863098461     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (37)

1. D. APPLEGATE, R. BIXBY, V. CHVÁTAL, and W. COOK, "Finding cuts in the TSP (A preliminary report)," Report No. 95-05, Center for Discrete Mathematics and Theoretical Computer Science (DIMACS), Rutgers University, Piscataway, NJ, 1995.
2. J. BEARDWOOD, J. H. HALTON, and J. M. HAMMERSLEY, "The shortest path through many points," Proc. Cambridge Philos. Soc. 55 (1959), 299-327.
3. J. L. BENTLEY, "Multidimensional binary search trees used for associative search," J. Assoc. Comput. Mach. 18 (1975), 309-517.
4. R. G. BLAND and D. F. SHALLCROSS, "Large traveling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation," Operations Res. Lett. 8(1989), 125-128.
5. C.-N. FIECHTER, "A parallel tabu search algorithm for large traveling salesman problems," Disc. Applied Math. 51 (1994), 243-267.
6. M. X. GOEMANS, private communication (1995).
7. M. X. GOEMANS and D. BERTSIMAS, "Probabilistic analysis of the Held-Karp lower bound for the Euclidean traveling salesman problem," Math. Oper. Res. 16 (1991), 72-89.
8. M. GRÖTSCHEL, L. LOVÁSZ, and A. SCHRIJVER, Geometric Algorithms and Combinatorial Optimization, Springer, Berlin, 1988.
9. K. H. HELBIG-HANSEN AND J. KRARUP, "Improvements of the Held-Karp algorithm for the symmetric traveling salesman problem," Math. Programming 7 (1974), 87-96.
10. M. HELD and R. M. KARP, "The traveling-salesman problem and minimum spanning trees," Operations Res. 18 (1970), 1138-1162.
11. M. HELD and R. M. KARP, "The traveling-salesman problem and minimum spanning trees: Part II," Math. Programming 1 (1971), 6-25.
12. M. HELD, P. WOLFE, and H. P. CROWDER, "Validation of subgradient optimization," Math. Programming 6 (1974), 62-88.
13. P. JAILLET, "Cube versus torus models and the Euclidean minimum spanning tree constant," Ann. Appl. Probab. 3 (1992), 582-592.
14. D. S. JOHNSON, "New computational experiments on upper and lower bounds for the traveling salesman problem," talk given at the ORSA/TIMS Joint National Meeting (Philadelphia, October 29, 1990).
15. D. S. JOHNSON, "Local optimization and the traveling salesman problem," in Proc. 17th Colloq. on Automata, Languages, and Programming, Lecture Notes in Computer Science 443, Springer-Verlag, Berlin, 1990, 446-461.
16. D. S. JOHNSON, D. L. APPLEGATE, L. A. MCGEOCH, and E. E. ROTHBERG, "On fast methods for computing the Held-Karp traveling salesman bound," to appear.
17. D. S. JOHNSON, J. L. BENTLEY, L. A. MCGEOCH, and E. E. ROTHBERG, "Near-optimal solutions to very large traveling salesman problems," in preparation.
18. D. S. JOHNSON and L. A. MCGEOCH, "The traveling salesman problem: A case study in local optimization," to appear in Local Search in Combinatorial Optimization, E. H. L. Aarts and J. K. Lenstra (eds.), John Wiley & Sons, New York, 1995.
19. D. S. JOHNSON and E. E. ROTHBERG, implemented program (September 1985).
20. R. M. KARP and C. H. PAPADIMITRIOU, "On linear characterizations of combinatorial optimization problems," SIAM J. Comput. 11 (1982), 620-632.
21. D. E. KNUTH, The Art of Computer Programming, Volume 2: Seminumerical Algorithms, 2nd Edition, Addison-Wesley, Reading, Mass., 1981, 171-172.
22. W. KRAUTH and M. MÉZARD, "The cavity method and the travelling-salesman problem," Europhys. Lett. 8 (1989), 213-218.
23. E. L. LAWLER, J. K. LENSTRA, A. H. G. RINNOOY KAN, AND D. B. SHMOYS, The Traveling Salesman Problem, John Wiley & Sons, Chichester, 1985.
24. J. LEE and M. Y. CHOI, "Optimization by multicanonical annealing and the traveling salesman problem," Phys. Rev. E 50(1994), R651-R654.
25. H. L. ONG and H. C. HUANG, "Asymptotic expected performance of some TSP heuristics: An experimental evaluation," Eur. J. Oper. Res 43 (1989), 231-238.
26. A. G. PERCUS and O. C. MARTIN, "Finite size and dimensional dependence in the Euclidean traveling salesman problem," Phys. Rev. Lett., to appear.
27. G. REINELT, "TSPLIB-A traveling salesman problem library," ORSA J. Comput. 3 (1991), 376-384.
28. G. REINELT, The Traveling Salesman Problem: Computational Solutions for TSP Applications, Lecture Notes in Computer Science 840, Springer-Verlag, Berlin, 1994, 172-186.
29. G. REINELT, personal communication.
30. W. T. RHEEAND M. TALAGRAND, "A sharp deviation inequality for the stochastic traveling salesman problem," Annals of Probability 17(1988), 1-8.
31. D. B. SHMOYS and D. P. WILLIAMSON, "Analyzing the Held-Karp TSP bound: A monotonicity property with applications," Inform. Process. Lett. 35 (1990), 281-285.
32. T. H. C. SMITH and G. L. THOMPSON, "A LIFO implicit enumeration search algorithm for the symmetric traveling salesman problem using Held & Karp's 1-tree relaxation," Ann. Disc. Math. 1 (1977), 479-493.
33. J. M. STEELE, "Complete convergence of short paths and Karp's algorithm for the TSP," Math. Oper. Res. 6 (1989), 374-378.
34. D. STEIN, Scheduling Dial-a-Ride Transportation Systems: An Asymptotic Approach, Ph.D. Dissertation, Harvard University, Cambridge, MA, 1977.
35. T. VOLGENANT and R. JONKER, "A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation," Eur. J. Oper. Res 9 (1982), 83-89.
36. C. L. VALENZUELA and A. J. JONES, "Estimating the Held-Karp lower bound for the geometric TSP," Manuscript dated 8 June 1995.
37. L. WOLSEY, "Heuristic analysis, linear programming, and branch and bound," Math. Prog. Study 13 (1980), 121-134.