Separating maximally violated comb inequalities in planar graphs

Mathematics of Operations Research

Volumn 24, Issue 1, 1999, Pages 130-148

  Fleischer, L ^a   Tardos, E ^b  

^a Columbia University ^*  (United States)

^b Department of Computer Science and School of Operations Research and Information Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; GRAPH THEORY; INTEGER PROGRAMMING;

COMB INEQUALITIES; PLANAR GRAPHS;

TRAVELING SALESMAN PROBLEM;

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

References (37)

1. Applegate, D., R. Bixby, V. Chvátal, W. Cook (1995). Finding cuts in the TSP (a preliminary report). TR 95-05, DIMACS, Rutgers University, New Brunswick, NJ.
2. Benczúr, A. A. (1997). Cut structures and randomized algorithms in edge-connectivity problems. PhD thesis, Department of Mathematics, Massachusetts Institute of Technology, Cambridge, MA.
3. Bixby, R. E. (1975). The minimum number of edges and vertices in a graph with edge connectivity n and m n-bonds. Networks 5 253-298.
4. Booth, K. S., G. S. Lueker (1976). Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. J. Computer and System Sciences 13 335-379.
5. Caprara, A., M. Fischetti, A. N. Letchford (1997). On the separation of maximally violated mod-k cuts. To appear in Math. Programming.
6. Carr, R. (1997). Separating clique trees and bipartition inequalities having a fixed number of handles and teeth in polynomial time. Math. Oper. Res. 22 257-265.
7. Chvátal, V. (1973). Edmonds polytopes and weakly hamiltonian graphs. Math. Programming 5 29-40.
8. Crowder, H., M. W. Padberg (1980). Solving large-scale symmetric travelling salesman problems to optimality. Management Sci. 26 495-509.
9. Dantzig, G. B., D. R. Fulkerson, S. M. Johnson (1954). Solution of a large-scale traveling-salesman problem. Oper. Res. 2 393-410.
10. De Vitis, A. (1997). The cactus representation of all minimum cuts in a weighted graph. TR 454, IASI-CNR, Rome.
11. Dinits, E. A., A. V. Karzanov, M. V. Lomonosov (1976). On the structure of a family of minimal weighted cuts in a graph. In A. A. Fridman, editor, Studies in Discrete Optimization, Moscow Nauka, 290-306. Original article in Russian. Article is not published in English. This manuscript is an English translation obtained from ITC-International Translations Centre, Schuttersveld 2, 2611 WE Delft, The Netherlands. (ITC 85-20220). A translation is also available from NTC-National Translations Center, Library of Congress, Cataloging Distribution Service, Washington DC 20541, USA (NTC 89-20265).
12. Edmonds, J. (1965). Maximum matching and a polyhedron with 0, 1-vertices. J. Res. Nat. Bur. Standards 69B 125-130.
13. Fleischer, L. (1998). Building the chain and cactus representations of all minimum cuts from Hao-Orlin in same asymptotic run time. In R. Bixby, E. A. Boyd, and R. Z. Rios Mercado, editors, Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science. Springer-Verlag. Extended Abstract. Submitted to J. Algorithms.
14. _ (1997). Separating maximally violated comb inequalities in planar graphs. Ph.D. Thesis, Cornell University, Ithaca, NY.
15. _, E. Tardos. (1996) Separating maximally violated comb inequalities in planar graphs. In Integer Programming and Combinatorial Optimization: 5th International IPCO Conference, Lecture Notes in Computer Science 1084 475-489.
16. Gabow, H. N. (1991). Applications of a poset representation to edge connectivity and graph rigidity. In Proc. 32nd Annual Symp. on Found. of Comp. Sci., 812-821.
17. _ (1991). Applications of a poset representation to edge connectivity and graph rigidity. Technical Report CU-CS-545-91, Department of Computer Science, University of Colorado, Boulder, CO.
18. Goemans, M., K. Talluri (1991). 2-change for k-connected networks. Oper. Res. Letters 10 113-117.
19. Grötschel, M. (1980). On the symmetric travelling salesman problem: solution of a 120-city problem. Math. Programming Study 12 61-77.
20. _, O. Holland (1991). Solution of large-scale symmetric travelling salesman problems. Math. Programming 51 141-202.
21. _, M. W. Padberg (1979). On the symmetric travelling salesman problem i: Inequalities. Math. Programming 16 265-280.
22. _, _ (1979). On the symmetric travelling salesman problem ii: Lifting theorems and facets. Math. Programming 16 281-302.
23. Hao, J., J. B. Orlin (1992). A faster algorithm for finding the minimum cut in a graph. In Proc. of 3rd ACM-SIAM Symp. on Discrete Algorithms, 165-174.
24. Jünger, M., G. Reinelt, G. Rinaldi (1994). The traveling salesman problem. Technical Report 375, IASI-CNR, Rome.
25. Karger, D. R., C. Stein (1996). A new approach to the minimum cut problem. J. of the ACM 43 601-640.
26. Karzanov, A. V., E. A. Timofeev (1986). Efficient algorithms for finding all minimal edge cuts of a nonoriented graph. Cybernetics, 22:156-162. Translated from (1996) Kibernetika 2 8-12.
27. Karzanov, A. V., E. A. Timofeev (1986). Efficient algorithms for finding all minimal edge cuts of a nonoriented graph. Cybernetics, 22:156-162. Translated from (1996) Kibernetika 2 8-12.
28. Lawler, E. L., J. K. Lenstra, A. H. G. Rinnooy Kan, D. B. Shmoys, editors (1985). The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. John Wiley & Sons, New York.
29. Letchford, A. M. (1998). Separating a superclass of comb inequalities in planar graphs. Sumitted to Math. Oper. Res.
30. Nagamochi, H., T. Ibaraki (1992). Computing edge-connectivity of multigraphs and capacitated graphs. SIAM J. Disc. Math. 5 54-66.
31. _, T. Kameda (1994). Canonical cactus representation for minimum cuts. Japan J. Industrial Appl. Math. 11 343-361.
32. _, Y. Nakao, T. Ibaraki (1997). A fast algorithm for cactus representations of minimum cuts. Technical report 97012, Dept. of Applied Math and Physics, Kyoto University, Kyoto.
33. Naor, D., V. V. Vazirani (1991). Representing and enumerating edge connectivity cuts in RNC. In Proc. Second Workshop on A lgorithms and Data Structures, Lecture Notes in Computer Science 519, Springer-Verlag, 273-285.
34. Padberg, M. W., M. R. Rao (1982). Odd minimum cut-sets and b-matchings. Math. Oper. Res. 7 67-80.
35. _ and G. Rinaldi (1987). Optimization of a 532-city symmetric traveling salesman problem by branch and cut. Oper. Res. Letters 6 1-7.
36. _, _ (1990). Facet identification for the symmetric traveling salesman polytope. Math. Programming 47 219-257.
37. Williamson, D. P. (1990). Analysis of the held-karp heuristic for the traveling salesman problem. Master's thesis, Massachusetts Institute of Technology. TR-479, M.I.T. Laboratory for Computer Science, Cambridge, MA.