On Lovász-Schrijver lift-and-project procedures on the Dantzig-Fulkerson-Johnson relaxation of the TSP

SIAM Journal on Optimization

Volumn 16, Issue 2, 2006, Pages 380-399

  Cheung, Kevin K H ^a  

^a CARLETON UNIVERSITY   (Canada)

Author keywords

Integrality gap; Lift and project; Relaxation; Traveling salesman problem

Indexed keywords

COSTS; INTEGRAL EQUATIONS; LINEAR SYSTEMS; OPTIMIZATION; PROBLEM SOLVING; RELAXATION PROCESSES;

DANTZIG-FULKERSON-JOHNSON FORMULATION; INTEGRALITY GAP; LIFT-AND-PROJECT; RELAXATION;

TRAVELING SALESMAN PROBLEM;

EID: 33646719965     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/040605849     Document Type: Article

References (21)

1. S. ARORA, B. BOLLOBÁS, AND L. LOVÁSZ, Proving integrality gaps without knowing the linear program, in Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, 2002, pp. 313-322.
2. S. BOYD AND R. CARR, Finding Low Cost TSP and 2-Matching Solutions Using Certain Half-Integer Subtour Vertices, Technical report TR-96-12, University of Ottawa, Ottawa, 2002.
3. S. BOYD AND G. LABONTÉ, Finding the exact integrality gap for small traveling salesman problems, in Proceedings of the 9th Conference on Integer Programming and Combinatorial Optimization, Lecture Notes in Comput. Sci. 2337, W. J. Cook and A. S. Schulz, eds., Springer-Verlag, Berlin, 2002, pp. 83-92.
4. R. CARR AND S. VEMPALA, Towards a 4/3 approximation for the asymmetric traveling salesman problem, in Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, ACM, New York, SIAM, Philadelphia, 2000, pp. 116-125.
5. W. COOK AND S. DASH, On the matrix-cut rank of polyhedra, Math. Oper. Res., 26 (2001), pp. 19-30.
6. G. B. DANTZIG, D. R. FULKERSON, AND S. M. JOHNSON, Solution of a large-scale traveling-salesman problem, J. Operations Res. Soc. Amer., 2 (1954), pp. 393-410.
7. J. EDMONDS, Maximum matching and polyhedron with 0,1 vertices, J. Res. Nat. Bur. Standards Sect. B, 69B (1965), pp. 125-130.
8. L. K. FLEISCHER, A. N. LETCHFORD, AND A. LODI, Polynomial-Time Separation of a Superclass of Simple Comb Inequalities IBM Research Report RC23250, 2004. Available online at http://www.lancs.ac.uk/staff/letchfoa/simple-dp.pdf.
9. M. X. GOEMANS, Worst-case comparison of valid inequalities for the TSP, Math. Programming Ser. A., 69 (1995), pp. 335-349.
10. M. X. GOEMANS AND L. TUNÇEL, When does the positive semidefiniteness constraint help in lifting procedures?, Math. Oper. Res., 26 (2001), pp. 796-815.
11. M. GRÖTSCHEL, L. LOVÁSZ, AND A. SCHRIJVER, Geometric Algorithms and Combinatorial Optimization, Springer-Verlag, Berlin, 1988.
12. M. GRÖTSCHEL AND M. PADBERG, On the symmetric travelling salesman problem II: Lifting theorems and facets, Math. Programming, 16 (1979), pp. 281-302.
13. M. LAURENT, Tighter linear and semidefinite relaxations for MAX-CUT based on the Lovász-Schrijver lift-and-project procedure, SIAM J. Optim., 12 (2001), pp. 345-375.
14. A. N. LETCHFORD AND A. LODI, Polynomial-time separation of simple comb inequalities, in Proceedings of the 9th Conference on Integer Programming and Combinatorial Optimization, Lecture Notes in Comput. Sci. 2337, W. J. Cook and A. S. Schulz, eds., Springer-Verlag, Berlin, 2002, 93-108.
15. L. LIPTÁK AND L. TUNÇEL, The stable set problem and the lift-and-project ranks of graphs, Math. Programming Ser. B, 98 (2003), pp. 319-353.
16. L. LOVÁSZ AND A. SCHRIJVER, Cones of matrices and set-functions and 0-1 optimization, SIAM J. Optim., 1 (1991), pp. 166-190.
17. M. W. PADBERG AND M. R. RAO, Odd minimum cut-sets and b-matchings, Math. Oper. Res., 7 (1982), pp. 67-80.
18. C. H. PAPADIMITRIOU AND S. VEMPALA, On the approximability of the traveling salesman problem, in Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, ACM, New York, 2000, pp. 126-133.
19. D. B. SHMOYS AND D. P. WILLIAMSON, Analyzing the Held-Karp TSP bound: A monotonicity property with application, Inform. Process. Lett., 35 (1990), pp. 281-285.
20. T. STEPHEN AND L. TUNÇEL, On a representation of the matching polytope via semidefinite liftings, Math. Oper. Res., 24 (1999), pp. 1-7.
21. L. A. WOLSEY, Heuristic analysis, linear programming and branch and bound, Math. Programming Stud., 13 (1980), pp. 121-134.