On the integrality ratio for asymmetric TSP

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2004, Pages 101-107

  Charikar, Moses ^a   Goemans, Michel X ^b   Karloff, Howard ^c  

^a Princeton University   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMMETRIC TRAVELING SALES PROBLEM (ASTP); INTEGRALITY RATIO; POLYNOMIAL TIME; VERTICES;

APPROXIMATION THEORY; COMBINATORIAL MATHEMATICS; INTEGRAL EQUATIONS; MATHEMATICAL PROGRAMMING; MOLECULAR DYNAMICS; POLYNOMIALS; PROBLEM SOLVING;

TRAVELING SALESMAN PROBLEM;

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

References (26)

1. L. M. Adleman, "Molecular Computation of Solutions to Combinatorial Problems," Science 266, 1994, 1021-1024.
2. D. Applegate, R. Bixby, V. Chvátal and W. Cook, the traveling salesman problem homepage, http://www.math.princeton.edu/tsp/index.html.
3. S. Arora, "Polynomial-Time Approximation Schemes For Euclidean TSP and Other Geometric Problems," JACM45 (5) 753-782, 1998.
4. M. Bläser, "A New Approximation Algorithm for the Asymmetric TSP with Triangle Inequality," Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, 2002, 638-645.
5. S. Boyd and P. Elliott, "Finding the Exact Integrality Gap for Small ATSP's," talk presented at the Combinatorial Optimisation 2004 conference (CO2004), Lancaster, England.
6. S. Boyd and G. Labonté, "Finding the Exact Integrality Gap for Small Traveling Salesman Problems," Proceedings of the 9th Conference on Integer Programming and Combinatorial Optimization, 2002, 83-92.
7. R. Carr and S. Vempala, "Towards a 4/3 Approximation Algorithm for the Asymmetric TSP," Mathematical Programming 100 (3), 2004, 569-587.
8. N. Christofides, "Worst-Case Analysis of a New Heuristic for the Traveling Salesman Problem," Technical Report, GSIA, Carnegie-Mellon University, 1976.
9. M. Dorigo, V. Maniezzo and A. Colorni, "The Ant System: Optimization by a Colony of Cooperating Agents," IEEE Transactions on Systems, Man, and Cybernetics-Part B 26,1996, 29-41.
10. A. M. Frieze, G. Galbiati and M. Maffioli, "On the Worst-Case Performance of Some Algorithms for the Asymmetric Traveling Salesman Problem," Networks 12, 1992, 23-39.
11. M. X. Goemans and D. Bertsimas, "Survivable Networks, Linear Programming Relaxations and the Parsimonious Property," Mathematical Programming 60, 1993, 145-166.
12. M. Held and R. M. Karp, "The Traveling Salesman Problem and Minimum Spanning Trees," Operations Research 18, 1970, 1138-1162.
13. M. Held and R. M. Karp, "The Traveling-Salesman Problem and Minimum Spanning Trees: Part II," Mathematical Programming 1, 1971, 6-25.
14. D. S. Johnson, personal communication, 2004.
15. D. S. Johnson, G. Gutin, L. A. McGeoch, A. Yeo, W. Zhang, and A. Zverovich, "Experimental Analysis of Heuristics for the ATSP," in The Traveling Salesman Problem and its Variations, G. Gutin and A. Punnen, editors, Kluwer Academic Publishers, Dordrecht, 2002, 445-487.
16. D. S. Johnson and L. A. McGeoch, "Experimental Analysis of Heuristics for the STSP," in The Traveling Salesman Problem and its Variations, G. Gutin and A. Punnen, editors, Kluwer Academic Publishers, Dordrecht, 2002, 369-443.
17. D. S. Johnson, L. A. McGeoch, and E. E. Rothberg, "Asymptotic Experimental Analysis for the Held-Karp Traveling Salesman Bound," Proceedings of the 7th ACM-SIAM Symposium on Discrete Algorithms, 1996, 341-350.
18. H. Kaplan, M. Lewenstein, N. Shafir and M. Sviridenko, "Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multidigraphs," Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, 2003, 56-67.
19. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Ran and D. B. Shmoys, "The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization," John Wiley & Sons Ltd., 1985.
20. J. S. B. Mitchell, "Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems," SIAM J. Comput. 28(4), 1999, 1298-1309.
21. C. Monma, B. Munson, and W. Pulleyblank, "Minimum-Weight Two-Connected Spanning Networks," Mathematical Programming 46, 1990, 153-171.
22. P. Moscato, "On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts: Towards Memetic Algorithms," Caltech Concurrent Computation Program, Report 790, 1989.
23. C. H. Papadimitriou and S. Vempala, "On the Approximability of the Traveling Salesman Problem," Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, 2000, 126-133.
24. D. Shmoys and D. Williamson, "Analyzing the Held-Karp TSP Bound: A Monotonicity Property with Application," Information Processing Letters 35 (6), 1990, 281-285.
25. D. P. Williamson, "Analysis of the Held-Karp Heuristic for the Traveling Salesman Problem," M.S. Thesis, Massachusetts Institute of Technology, 1990.
26. L. A. Wolsey, "Heuristic Analysis, Linear Programming and Branch and Bound," Mathematical Programming Study 13, 1980, 121-134.