Polynomial-time separation of simple comb inequalities

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

Volumn 2337 LNCS, Issue , 2002, Pages 93-108

  Letchford, Adam N ^a   Lodi, Andrea ^b  

^a LANCASTER UNIVERSITY   (United Kingdom)

^b UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; POLYNOMIAL APPROXIMATION; SEPARATION; TRAVELING SALESMAN PROBLEM; ALGORITHMS; OPTIMIZATION; POLYNOMIALS;

CARDINALITIES; FRACTIONAL SOLUTIONS; LP RELAXATION; POLYNOMIAL-TIME; POLYNOMIAL-TIME ALGORITHMS; VERTEX SET;

INTEGER PROGRAMMING;

EID: 84868666177     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-47867-1_8     Document Type: Conference Paper

References (31)

1. D. Applegate, R.E. Bixby, V. Chvátal & W. Cook (1995) Finding cuts in the TSP (a preliminary report). Technical Report 95-05, DIMACS, Rutgers University, New Brunswick, NJ.
2. A. Caprara & M. Fischetti (1996) {0, 1/2 }-Chvátal-Gomory cuts. Math. Program. 74, 221-235.
3. A. Caprara, M. Fischetti & A.N. Letchford (2000) On the separation of maximally violated mod-κ cuts. Math. Program. 87, 37-56.
4. A. Caprara & A.N. Letchford (2001) On the separation of split cuts and related inequalities. To appear in Math. Program.
5. R. Carr (1997) Separating clique trees and bipartition inequalities having a fixed number of handles and teeth in polynomial time. Math. Oper. Res. 22, 257-265.
6. V. Chvátal (1973) Edmonds polytopes and weakly Hamiltonian graphs. Math. Program. 5, 29-40.
7. G.B. Dantzig, D.R. Fulkerson & S.M. Johnson (1954) Solution of a large-scale traveling salesman problem. Oper. Res. 2, 393-410.
8. J. Edmonds (1965) Maximum matching and a polyhedron with 0-1 vertices. J. Res. Nat. Bur. Standards 69B, 125-130.
9. L. Fleischer & É. Tardos (1999) Separating maximally violated comb inequalities in planar graphs. Math. Oper. Res. 24, 130-148.
10. J. Fonlupt & D. Naddef (1992) The traveling salesman problem in graphs with excluded minors. Math. Program. 53, 147-172.
11. M.X. Goemans (1995) Worst-case comparison of valid inequalities for the TSP. Math. Program. 69, 335-349.
12. A.V. Goldberg & R.E. Tarjan (1988) A new approach to the maximum flow problem. J. of the A.C.M. 35, 921-940.
13. M. Grötschel & O. Holland (1987) A cutting plane algorithm for minimum perfect 2-matching. Computing 39, 327-344.
14. M. Grötschel, L. Lovász & A.J. Schrijver (1988) Geometric Algorithms and Combinatorial Optimization. Wiley: New York.
15. M. Grötschel & M.W. Padberg (1979) On the symmetric traveling salesman problem I: inequalities. Math. Program. 16, 265-280.
16. M. Grötschel & M.W. Padberg (1979) On the symmetric traveling salesman problem II: lifting theorems and facets. Math. Program. 16, 281-302.
17. M. Grötschel & K. Truemper (1989) Decomposition and optimization over cycles in binary matroids. J. Comb. Th. (B) 46, 306-337.
18. M.R. Hensinger & D.P. Williamson (1996) On the number of small cuts in a graph. Inf. Proc. Lett. 59, 41-44.
19. M. Jünger, G. Reinelt, G. Rinaldi (1995) The traveling salesman problem. In M. Ball, T. Magnanti, C. Monma & G. Nemhauser (eds.). Network Models, Handbooks in Operations Research and Management Science, 7, Elsevier Publisher B.V., Amsterdam, 225-330.
20. M. Jünger, G. Reinelt & G. Rinaldi (1997) The traveling salesman problem. In M. Dell'Amico, F. Maffioli & S. Martello (eds.) Annotated Bibliographies in Combinatorial Optimization. Chichester, Wiley, 199-221.
21. A.N. Letchford (2000) Separating a superclass of comb inequalities in planar graphs. Math. Oper. Res. 25, 443-454.
22. D. Naddef (2001) Polyhedral theory and branch-and-cut algorithms for the symmetric TSP. In G. Gutin & A. Punnen (eds.), The Traveling Salesman Problem and its Variations. Kluwer Academic Publishers, 2002 (to appear).
23. D. Naddef & G. Rinaldi (1991) The symmetric traveling salesman polytope and its graphical relaxation: composition of valid inequalities. Math. Program. 51, 359-400.
24. D. Naddef & G. Rinaldi (1993) The graphical relaxation: a new framework for the symmetric traveling salesman polytope. Math. Program. 58, 53-88.
25. D. Naddef & S. Thienel (1998) Efficient separation routines for the symmetric traveling salesman problem I: general tools and comb separation. Working paper, LMC-IMAG, Grenoble.
26. H. Nagamochi, K. Nishimura and T. Ibaraki (1997) Computing all small cuts in undirected networks. SIAM Disc. Math. 10, 469-481.
27. G.L. Nemhauser and L.A. Wolsey (1988) Integer and Combinatorial Optimization. New York: Wiley.
28. M.W. Padberg & M. Grötschel (1985) Polyhedral computations. In E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan & D.B. Schmoys (Eds.) The Traveling Salesman Problem. John Wiley & Sons, Chichester.
29. M.W. Padberg & M.R. Rao (1982) Odd minimum cut-sets and b-matchings. Math. Oper. Res. 7, 67-80.
30. M.W. Padberg & G. Rinaldi (1990) Facet identification for the symmetric traveling salesman polytope. Math. Program. 47, 219-257.
31. M.W. Padberg & G. Rinaldi (1991) A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems. SIAM Rev. 33, 60-100.