On the Held-Karp relaxation for the asymmetric and symmetric traveling salesman problems

Mathematical Programming

Volumn 100, Issue 3, 2004, Pages 569-587

  Carr, Robert ^a   Vempala, Santosh ^b  

^a SANDIA NATIONAL LABORATORIES   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHM; COMBINATORIAL OPTIMIZATION; HELD-KARP RELAXATION; SYMMETRIC TRAVELING SALESMAN PROBLEM (STSP);

ALGORITHMS; APPROXIMATION THEORY; COMBINATORIAL MATHEMATICS; FUNCTIONS; HAMILTONIANS; OPTIMIZATION; PROBLEM SOLVING;

TRAVELING SALESMAN PROBLEM;

EID: 17744389060     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-004-0506-y     Document Type: Article

References (12)

1. Boyd, S., Carr, R.: Finding Low Cost TSP and 2-matching Solutions Using Certain Half-Integer Subtour Vertices. Working Paper, 1999
2. Carr, R., Ravi, R.: A New Bound for the 2-Edge Connected Subgraph Problem. IPCO Proceedings, 1998, pp. 112-125
3. Christofides, N.: Worst-case analysis of a new heuristic for the traveling salesman problem. Tech. Rep., GSIA, Carnegie Mellon University, 1976
4. Frieze, A., Galbiati, G., Maffioli, F.: On the worst-case performance of some algorithms for the asymmetric traveling salesman problem. Networks 12, 23-39 (1982)
5. Goemans, M., Bertsimas, D.: Survivable networks, linear programming relaxations and the parsimonious property. Math. Program. 60, 145-166 (1993)
6. Goemans, M.: Worst Case Comparison of Valid Inequalities for the TSP. Math. Program. 69, 335-349 (1995)
7. Grötschel, M., Lovász, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Springer, 1988
8. Held, M., Karp, R.M.: The traveling salesman problem and minimum spanning trees. Oper. Res. 18, 1138-1162 (1970)
9. Lovász, L.: On some connectivity properties of Eulerian graphs. Acta Mathematica Academiae Scientiarum Hungaricae 28, 129-138 (1976)
10. Monma, C.L., Munson, B.S., Pulleyblank, W.R.: Minimum weight two-connected spanning networks. Math. Program. 46, 153-171 (1990)
11. Papadimitriou, C., Yannakakis, M.: The traveling salesman problem with distances one and two. Math. Oper. Res. 18(1), 1-11 (1993)
12. Sahni, S., Gonzalez, T.: P-complete approximation problems. JACM 23, 555-565 (1976)