A simple LP relaxation for the asymmetric traveling salesman problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5171 LNCS, Issue , 2008, Pages 207-218

  Nguyen, Thành ^a  

^a 657 Rhodes Hall ^*  (United States)

Author keywords

ATSP; LP relaxation

Indexed keywords

APPROXIMATION ALGORITHMS; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; LEARNING SYSTEMS; OPTIMIZATION; POLYNOMIAL APPROXIMATION; SOLUTIONS;

ASYMMETRIC TRAVELING SALESMAN PROBLEM; ATSP; COMBINATORIAL OP-TIMIZATION PROBLEM; HELD-KARP RELAXATION; INTEGRALITY GAPS; LP RELAXATION; TOTAL COSTS;

TRAVELING SALESMAN PROBLEM;

EID: 51849090139     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85363-3_17     Document Type: Conference Paper

References (17)

1. Bansal, N., Khandekar, R., Nagarajan, V.: Additive Guarantees for Degree Bounded Directed Network Design. In: STOC 2008 (2008)
2. Bläser, M.: A new Approximation Algorithm for the Asymmetric TSP with Triangle Inequality. In: SODA 2002, pp. 638-645 (2002)
3. Charikar, M., Goemans, M.X., Karloff, H.J.: On the Integrality Ratio for Asymmetric TSP. In: FOCS 2004, pp. 101-107 (2004)
4. Carr, R., Vempala, S.: On the Held-Karp relaxation for the asymmetric and symmetric TSPs. Mathematical Programming 100(3), 569-587 (2004)
5. Frank, A.: Personal communication
6. Frieze, A., Galbiati, G., Maffioli, M.: On the worst-case performance of some algorithms for the asymmetric traveling salesman problem. Networks 12 (1982)
7. Goemans, M.X.: Minimum Bounded Degree Spanning Trees. In: FOCS 2006, pp. 273-282 (2006)
8. Gutin, G., Punnen, A.P. (eds.): Traveling Salesman Problem and Its Variations. Springer, Berlin (2002)
9. Held, M., Karp, R.M.: The traveling salesman problem and minimum spanning trees. Operation Research 18, 1138-1162 (1970)
10. Hoffman, A.J.: Some recent applications of the theory of linear inequalities to extremal combinatorial analysis. In: Proc. Symp. in Applied Mathematics, Amer. Math. Soc., pp. 113-127 (1960)
11. Jain, K.: A factor 2 approximation for the generalized Steiner network problem. Combinatorica 21, 39-60 (2001)
12. Kaplan, H., Lewenstein, M., Shafir, N., Sviridenko, M.: Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multidigraphs. In: Proc. of IEEE FOCS, pp. 56-67 (2003)
13. Schrijver, A.: Combinatorial Optimization - Polyhedra and Efficiency. Springer, Berlin (2003)
14. Lau, L.C., Naor, J., Salavatipour, M.R., Singh, M.: Survivable network design with degree or order constraints. In: STOC 2007, pp. 651-660 (2007)
15. Lau, L.C., Singh, M.: Approximating minimum bounded degree spanning trees to within one of optimal. In: STOC 2007, pp. 661-670 (2007)
16. Lawler, E., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D. (eds.): The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. John Wiley & Sons Ltd., Chichester (1985)
17. Vempala, S., Yannakakis, M.: A Convex Relaxation for the Asymmetric TSP. In: SODA 1999, pp. 975-976 (1999)