Odd minimum cut sets and b-Matchings revisited

SIAM Journal on Discrete Mathematics

Volumn 22, Issue 4, 2008, Pages 1480-1487

  Letchford, Adam N ^a   Reinelt, Gerhard ^b   Theis, Dirk Oliver ^c  

^a LANCASTER UNIVERSITY   (United Kingdom)

^b UNIVERSITY OF HEIDELBERG   (Germany)

^c UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

Matching; Polyhedra; Separation

Indexed keywords

B-MATCHING; MATCHING; MATCHINGS; MINIMUM CUT SETS; SEPARATION ALGORITHMS; SIMPLE ALGORITHM;

EID: 70449634804     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/060664793     Document Type: Article

References (18)

1. J. M. Belenguer and E. Benavent, The capacitated arc routing problem: Valid inequalities and facets, Comput. Optim. Appl., 10 (1998), pp. 165-187. (Pubitemid 128517547)
2. A. Caprara and M. Fischetti, {0, 1 2 }-Chv́atal-Gomory cuts, Math. Programming, 74 (1996), pp. 221-235.
3. J. Edmonds, Maximum matching and a polyhedron with 0-1 vertices, J. Res. Nat. Bur. Standards Sect. B, 69B (1965), pp. 125-130.
4. G. Ghiani and G. Laporte, A branch-and-cut algorithm for the undirected rural postman problem, Math. Program., 87 (2000), pp. 467-481. (Pubitemid 32212483)
5. R. E. Gomory and T. C. Hu, Multi-terminal network flows, J. Soc. Indust. Appl. Math., 9 (1961), pp. 551-570.
6. M. Grötschel and O. Holland, A cutting plane algorithm for minimum perfect 2- matching, Computing, 39 (1987), pp. 327-344. (Pubitemid 18562738)
7. M. Grötschel, L. Lov́asz, and A. J. Schrijver, Geometric Algorithms and Combinatorial Optimization, Springer-Verlag, Berlin, 1988.
8. M. Grötschel, C. L. Monma, and M. Stoer, Computational results with a cutting plane algorithm for designing communication networks with low-connectivity constraints, Oper. Res., 40 (1992), pp. 309-330.
9. M. Grötschel and M. W. Padberg, On the symmetric travelling salesman problem I: Inequalities, Math. Programming, 16 (1979), pp. 265-280. (Pubitemid 9461203)
10. M. Grötschel and M. W. Padberg, On the symmetric travelling salesman problem II: Lifting theorems and facets, Math. Programming, 16 (1979), pp. 281-302. (Pubitemid 9461204)
11. A. V. Goldberg and R. E. Tarjan, A new approach to the maximum flow problem, J. Assoc. Comput. Math., 35 (1988), pp. 921-940.
12. A. N. Letchford, G. Reinelt, and D. O. Theis, A faster exact separation algorithm for blossom inequalities, in Integer Programming and Combinatorial Optimization 10, D. Bienstock and G. Nemhauser, eds., Lecture Notes in Comput. Sci. 3064, Springer- Verlag, Berlin, 2004, pp. 196-205. (Pubitemid 38835392)
13. J. Lysgaard, A. N. Letchford, and R. W. Eglese, A new branch-and-cut algorithm for the capacitated vehicle routing problem, Math. Programming, 100 (2004), pp. 423-445. (Pubitemid 40878095)
14. A. R. Mahjoub, Two-edge connected spanning subgraphs and polyhedra, Math. Programming, 64 (1994), pp. 199-208.
15. M. W. Padberg and M. R. Rao, Odd minimum cut-sets and b-matchings, Math. Oper. Res., 7 (1982), pp. 67-80.
16. M. Padberg and G. Rinaldi, Facet identification for the symmetric traveling salesman polytope, Math. Program., 47 (1990), pp. 219-257. (Pubitemid 20719386)
17. W. R. Pulleyblank, Faces of Matching Polyhedra, Ph.D. thesis, University of Waterloo, Waterloo, Ontario, 1973.
18. R. Rizzi, Minimum T-cuts and optimal T-pairings, Discrete Math., 257 (2002), pp. 177- 181.