Separation algorithms for classes of STSP inequalities arising from a new STSP relaxation

Mathematics of Operations Research

Volumn 29, Issue 1, 2004, Pages 80-91

  Carr, Robert ^a  

^a SANDIA NATIONAL LABORATORIES   (United States)

Author keywords

Inequalities; Lifting; Node lifting; Polyhedron; Polytope; Separation; Symmetric traveling salesman problem

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; GRAPH THEORY; INTEGER PROGRAMMING; LINEAR PROGRAMMING; LINEAR SYSTEMS; POLYNOMIALS; PROBLEM SOLVING; SET THEORY; THEOREM PROVING; VECTORS;

EDGE INCIDENCE VECTOR; NODE LIFTING OPERATION; POLYHEDRON; POLYTOPE; SEPARATION ALGORITHMS; SYMMETRIC TRAVELING SALESMAN PROBLEM;

TRAVELING SALESMAN PROBLEM;

EID: 4043088371     PISSN: 0364765X     EISSN: None     Source Type: Journal    
DOI: 10.1287/moor.1030.0058     Document Type: Article

References (27)

1. Applegate, D., R. E. Bixby, V. Chvátal, W. Cook. 1998. Project and lift (preliminary report). Technical report, Computer Sciences. Rutgers University, New Brunswick, NJ.
2. Applegate, D., R. E. Bixby, V. Chvátal, W. Cook. 2000. TSP cuts outside the template paradigm. Technical report, Computer Sciences. Rutgers University, New Brunswick, NJ. http://www.cs.rutgers.edu/~chvatal/dagstuhl.ps.
3. Boyd, S., W. Cunningham. 1991. Small traveling salesman polytopes. Math. Oper. Res. 16 259-271.
4. Caprara, A., M. Fischetti, A. N. Letchford. 2000. On the separation of maximally violated mod-k cuts. Math. Programming 87 37-56.
5. Carr, R. 1995. Polynomial separation procedures and facet determination for inequalities of the traveling salesman polytope. Ph.D. thesis, Department of Mathematics, Carnegie Mellon University, Pittsburgh, PA.
6. Carr, R. 1996. Separating over classes of TSP inequalities defined by 0-node lifting in polynomial time. IPCO Proc. IPCO Conference, Vancouver, British Columbia, 460-474.
7. Carr, R. 1997. Separating clique trees and bipartition inequalities having a fixed number of handles and teeth in polynomial time. Math. Oper. Res. 22(2) 257-265.
8. Carr, R. 2000. Some results on node lifting of TSP inequalities. J. Combin. Optim. 4(4) 395-414.
9. Carr, R., S. Vempala. 2000. Towards a 4/3 approximation for the asymmetric traveling salesman problem. SODA Conference, San Francisco, CA, 116-125.
10. Cornuejols, G., J. Fonlupt, D. Naddef. 1985. The traveling salesman problem on a graph and some related integer polyhedra. Math. Programming 33 1-27.
11. Edmonds, J. 1965. Maximum matching and a polyhedron with 0-1 vertices. J. Res. National Bureau Standards 69B 125-130.
12. Fleischer, L., E. Tardos. 1999. Separating maximally violated comb inequalities in planar graphs. Math. Oper. Res. 24(1) 130-148.
13. Goemans, M. X. 1995. Worst-case comparison of valid inequalities for the TSP. Math. Programming 69 335-349.
14. Gomory, R. E., T. C. Hu. 1961. Multi-terminal network flows. SIAM J. Appl. Math. 9 551-570.
15. Grötschel, M., M. W. Padberg. 1979. On the symmetric traveling salesman problem II: Lifting theorems and facets. Math. Programming 16 282-302.
16. Groetschel, M., L. Lovasz, A. J. Schrijver. 1988. Geometric Algorithms and Combinatorial Optimization. Wiley, New York.
17. Johnson, D. S., C. H. Papadimitriou. 1985. Computational complexity. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, D. B. Shmoys, eds. The Traveling Salesman Problem. John Wiley & Sons, Chichester, U.K., 37-85.
18. Jünger, M., G. Reinelt, G. Rinaldi. 1995. The traveling salesman problem. M. O. Ball, T. L. Magnanti, C. L. Monma, G. L. Nemhauser, eds. Network Models, Handbooks in OR & MS, Vol. 7. Elsevier Science B.V., Amsterdam, The Netherlands, 225-330.
19. Letchford, A. 2000. Separating a superclass of comb inequalities in planar graphs. Math. Oper. Res. 25(3) 443-454.
20. Letchford, A., A. Lodi. 2002. Polynomial-time separation of simple comb inequalities. IPCO Proc., 2002, Cambridge, MA, 93-108.
21. Naddef, D., J. M. Clochard. 1994. Some fast and efficient heuristics for comb separation in the symmetric traveling salesman problem. Tech. Rep., Université Joseph Fourier Grenoble I, Grenoble, France.
22. Naddef, D., G. Rinaldi. 1993. The graphical relaxation: A new framework for the symmetric traveling salesman polytope. Math. Programming 58 53-88.
23. Nemhauser, G. L., L. A. Wolsey. 1988. Integer and Combinatorial Optimization. Wiley, New York.
24. Padberg, M. W., M. R. Rao. 1982. Odd minimum cut sets and b-matchings. Math. Oper. Res. 7 67-80.
25. Padberg, M. W., G. Rinaldi. 1989. A branch-and-cut approach to a traveling salesman problem with side constraints. Management Sci. 35(11) 1393-1412.
26. Padberg, M. W., G. Rinaldi. 1990. Facet identification for the symmetric traveling salesman polytope, Math. Programming 47 219-257.
27. Yannakakis, M. 1991. Expressing combinatorial optimization problems by linear programs. J. Comp. System Sci. 43 441-466.