Separating a superclass of comb inequalities in planar graphs

Mathematics of Operations Research

Volumn 25, Issue 3, 2000, Pages 443-454

  Letchford, Adam N ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; POLYNOMIALS; PROBLEM SOLVING; RELAXATION PROCESSES; THEOREM PROVING; VECTORS;

BRANCH-AND-CUT ALGORITHMS; POLYNOMIAL TIME EXACT SEPARATION ALGORITHMS;

TRAVELING SALESMAN PROBLEM;

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

References (33)

1. Applegate, D., 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. 5. Oper. Res. Lett. 2 107-111.
3. Boyd, S. 1999. Private communication.
4. Caprara, A., M. Fischetti. 1996. {0, 1/2}-Chvátal-Gomory cuts. Math. Programming, 74 221-235.
5. _, _, A. N. Letchford. 2000. On the separation of maximally violated mod-k cuts. Math. Programming 87 37-56.
6. Carr, R. D. 1996. Separating over classes of TSP inequalities defined by 0 node-lifting in polynomial time. W. H. Cunningham, S. T. McCormick and M. Queyranne, eds. Integer Programming and Combinatorial Optimization 5, Lecture Notes in Computer Science 1084. Springer-Verlag, Berlin.
7. _. 1997. Separation and lifting of TSP inequalities. Working paper, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, PA.
8. Chvátal, V. 1973a. Edmonds polytopes and weakly Hamiltonian graphs. Math. Programming 5 29-40.
9. _. 1973b. Edmonds polytopes and a hierarchy of combinatorial problems. Discrete Math. 4 305-337.
10. Cornuéjols, G., J. Fonlupt, D. Naddef. 1985. The travelling salesman on a graph and some related integer polyhedra. Math. Programming 33 1-27.
11. Dantzig, G. B., D. R. Fulkerson, S. M. Johnson. 1954. Solution of a large-scale travelling salesman problem. Oper. Res. 2 393-410.
12. Edmonds, J. 1965. Maximum matching and a polyhedron with 0,1-vertices. J. Res. Nat. Bur. Standards 69B 125-130.
13. Fleischer, L., É. Tardos. 1999. Separating maximally violated comb inequalities in planar graphs. Math. Oper. Res. 24 130-148.
14. Fonlupt, J., A. R. Mahjoub, J. P. Uhry. 1992. Composition in the bipartite subgraph polytope. Discrete Math. 105 73-91.
15. Gerards, A. M. H., A. Schrijver. 1986. Matrices with the Edmonds-Johnson property. Combinatorica 6 365-379.
16. Grötschel, M., L. Lovász, A. J. Schrijver. 1988. Geometric Algorithms and Combinatorial Optimization. Springer-Verlag, Berlin, Germany.
17. _, M. W. Padberg. 1979a. On the symmetric travelling salesman problem I: Inequalities. Math. Programming 16 265-280.
18. _, _. 1979b. On the symmetric travelling salesman problem II: Lifting theorems and facets. Math. Programming 16 281-302.
19. _, W. R. Pulleyblank. 1981. Weakly bipartite graphs and the max-cut problem. Oper. Res. Lett. 1 23-27.
20. Hadlock, F. O. 1975. Finding a maximum cut of a planar graph in polynomial time. SIAM J. Comput. 4 221-225.
21. Henziger, M. R., P. Klein, S. Rao, S. Subramanian. 1997. Faster shortest-path algorithms for planar graphs. J. Comput. System Sci. 55 3-23.
22. Jünger, M. 1999. Private communication.
23. _, G. Reinelt, G. Rinaldi. 1995. The travelling salesman problem. M. Ball, T. Magnanti, C. Monma, G. Nemhauser, eds. Network Models. Handbooks in Operations Research and Management Science 7. Elsevier, Amsterdam, The Netherlands.
24. _, _, _. 1997. The travelling salesman problem. M. Dell'Amico, F. Maffioli and S. Martello, eds. Annotated Bibliographies in Combinatorial Optimization, Wiley, Chichester.
25. Lawler, E. L., J. K. Lenstra, A. H. G. Rinnooy-Kan, D. B. Shmoys (eds.) 1985. The Travelling Salesman Problem: A Guided Tour of Combinatorial Optimization. Wiley, New York.
26. Naddef, D., G. Rinaldi. 1992. The graphical relaxation: A new framework for the symmetric travelling salesman polytope. Math. Programming 58 53-88.
27. Nemhauser, G. L., L. A. Wolsey. 1988. Integer and Combinatorial Optimization. Wiley, New York.
28. Orlin, J. B., 1993. A faster strongly polynomial minimum cost flow algorithm. Oper. Res. 41 338-350.
29. Orlova, G. I., Y. G. Dorfman. 1972. Finding the maximum cut in a graph. Engrg. Cybernetics 10 502-506.
30. Padberg, M. W., M. Grötschel. 1985. Polyhedral computations. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnocy-Kan, D. B. Schmoys, eds. op cit.
31. _, M. R. Rao. 1982. Odd minimum cut-sets and 6-matchings. Math. Oper. Res. 7 67-80.
32. _, G. Rinaldi. 1990. Facet identification for the symmetric travelling salesman polytope. Math. Programming 47 219-257.
33. _, _. 1991. A branch- and-cut algorithm for the resolution of large-scale symmetric travelling salesman problems. SIAM Rev. 33 60-100.