On the integrality ratio for the asymmetric traveling salesman problem

Mathematics of Operations Research

Volumn 31, Issue 2, 2006, Pages 245-252

  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

Approximation algorithm; Asymmetric traveling salesman problem; ATSP; Held Kaip relaxation; Integrality ratio

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; INTEGRAL EQUATIONS; MATHEMATICAL MODELS; PROBLEM SOLVING; THEOREM PROVING;

APPROXIMATION ALGORITHMS; ASYMMETRIC TRAVELING SALESMAN PROBLEM (ATSP); HELD-KAIP RELAXATION; INTEGRALITY RATIO;

TRAVELING SALESMAN PROBLEM;

EID: 33748429746     PISSN: 0364765X     EISSN: 15265471     Source Type: Journal    
DOI: 10.1287/moor.1060.0191     Document Type: Article

References (27)

1. Adleman, L. M. 1994. Molecular computation of solutions to combinatorial problems. Science 266 1021-1024.
2. Applegate, D., R. Bixby, V. Chvátal, W. Cook, K. Helsgaun. The traveling salesman problem homepage. http://www.tsp.gatech.edu.
3. Arora, S. 1998. Polynomial-time approximation schemes for Euclidean TSP and other geometric problems, J. Assocation Comput. Machinery 45(5) 753-782.
4. Bläser, M. 2003. A new approximation algorithm for the asymmetric TSP with triangle inequality. Proc. 14th Annual ACM-SIAM Sympos. Discrete Algorithms, Baltimore, MD, 638-645.
5. Boyd, S., P. Elliott. 2004. Finding the exact integrality gap for small ATSP's. Combinatorial Optimisation Conference (C02004), Lancaster, England.
6. Boyd, S., G. Labonté. 2002. Finding the exact integrality gap for small traveling salesman problems. Proc. 9th Conf. Integer Programming Combin. Optim., 83-92.
7. Boyd, S., W. R. Pulleyblank. 1990. Optimizing over the subtour polytope of the traveling salesman problem. Math. Programming 49 163-187.
8. Carr, R., S. Vempala. 2004. Towards a 4/3 approximation algorithm for the asymmetric TSP. Math. Programming 100 569-587.
9. Christofides, N. 1976. Worst-case analysis of a new heuristic for the traveling salesman problem. Technical report, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, PA.
10. Dorigo, M., V. Maniezzo, A. Colorni. 1996. The ant system: Optimization by a colony of cooperating agents. IEEE Trans. Systems, Man, Cybernetics, Part B 26 29-41.
11. Frieze, A. M., G. Galbiati, M. Maffioli. 1992. On the worst-case performance of some algorithms for the asymmetric traveling salesman problem. Networks 12 23-39.
12. Goemans, M. X., D. Bertsimas. 1993. Survivable networks, linear programming relaxations and the parsimonious property. Math. Programming 60 145-166.
13. Held, M., R. M. Karp. 1970. The traveling salesman problem and minimum spanning trees. Oper. Res. 18 1138-1162.
14. Held, M., R. M. Karp. 1971. The traveling-salesman problem and minimum spanning trees: Part II. Math. Programming 1 6-25.
15. Johnson, D. S. 2004. Personal communication.
16. Johnson, D. S., L. A. McGeoch. 2002. Experimental analysis of heuristics for the STSP. G. Gutin, A. Punnen, eds. The Traveling Salesman Problem and its Variations. Kluwer Academic Publishers, Dordrecht, The Netherlands, 369-443.
17. Johnson, D. S., L. A. McGeoch, E. E. Rothberg. 1996. Asymptotic experimental analysis for the Held-Karp traveling salesman bound. Proc. 7th ACM-SIAM Sympos. Discrete Algorithms, 341-350.
18. Johnson, D. S., G. Gutin, L. A. McGeoch, A. Yeo, W. Zhang, A. Zverovich. 2002. Experimental analysis of heuristics for the ATSP. G. Gutin, A. Punnen, eds. The Traveling Salesman Problem and its Variations. Kluwer Academic Publishers, Dordrecht, The Netherlands, 445-487.
19. Kaplan, H., M. Lewenstein, N. Shafir, M. Sviridenko. 2003. Approximation algorithms for asymmetric TSP by decomposing directed regular multidigraphs. Proc. 44th Annual IEEE Sympos. Foundations Comput. Sci., Cambridge, MA, 56-67.
20. Lawler, E. L., J. K. Lenstra, A. H. G. Rinnooy Kan, D. B. Shmoys. 1985. The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. John Wiley & Sons Ltd.
21. Mitchell, J. S. B. 1999. Guillotine subdivisions approximate polygonal subdivisions: A simple polynomial-time approximation scheme for geometric TSP, k-MST, and related problems. SIAM J. Comput. 28 1298-1309.
22. Monma, C., B. Munson, W. Pulleyblank. 1990. Minimum-weight two-connected spanning networks. Math. Programming 46 153-171.
23. Moscato, P. 1989. On evolution, search, optimization, genetic algorithms and martial arts: Towards memetic algorithms. Report 790, Caltech Concurrent Computation Program, Pasadena, CA.
24. Papadimitriou, C. H., S. Vempala. 2000. On the approximability of the traveling salesman problem. Proc. 32nd Annual ACM Sympos. Theory Comput., Portland, OR, 126-133.
25. Shmoys, D., D. Williamson. 1990. Analyzing the Held-Karp TSP bound: A monotonicity property with application. Inform. Processing Lett. 35 281-285.
26. Williamson, D. P. 1990. Analysis of the Held-Karp heuristic for the traveling salesman problem. M.S. thesis, Massachusetts Institute of Technology.
27. Wolsey, L. A. 1980. Heuristic analysis, linear programming and branch and bound. Math. Programming Stud. 13 121-134.