A compact linear program for testing optimality of perfect matchings

Operations Research Letters

Volumn 31, Issue 6, 2003, Pages 429-434

  Ventura, Paolo ^a   Eisenbrand, Friedrich ^b  

^a Istituto di Analisi dei Sistemi ed   (Italy)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

Linear programming compact linear programming; Matching

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; OPERATIONS RESEARCH; POLYNOMIALS;

MATCHING;

LINEAR PROGRAMMING;

EID: 0141615785     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(03)00052-X     Document Type: Article

References (15)

1. Barahona F. On cuts and matchings in planar graphs. Math. Programming Ser. A. 60(1):1993;53-68.
2. Barahona F. Reducing matching to polynomial size linear programming. SIAM J. Optim. 3(4):1993;688-695.
3. Edmonds J. Maximum matching and a polyhedron with 0,1-vertices. J. Res. Natl. Bur. Standards. 69:1965;125-130.
4. Edmonds J. Paths, trees and flowers. Canad. J. Math. 17:1965;449-467.
5. Edmonds J., Johnson E.L. Matching, Euler tours and the Chinese postman. Math. Programming. 5:1973;88-124.
6. F. Eisenbrand, G. Rinaldi, P. Ventura, Primal separation for 0/1 polytopes, IASI-CNR Research Report 546, Istituto di Analisi dei Sistemi ed Informatica, Roma, Italy, 2001.
7. Grötschel M., Lovász L., Schrijver A. The ellipsoid method and its consequences in combinatorial optimization. Combinatorica. 1(2):1981;169-197.
8. Lovász L. Graph theory and integer programming. Ann. Discrete Math. 4:1979;141-158.
9. Padberg M.W., Rao M.R. Odd minimum cut-sets and. b -matchings Math. Oper. Res. 7:1982;67-80.
10. Schrijver A. Short proofs on the matching polyhedron. J. Combin. Theory Ser. B. 34(1):1983;104-108.
11. Schrijver A. Theory of Linear and Integer Programming. 1986;Wiley, New York.
12. P. Seymour, Sums of circuits, in: J. Bondy, A.P.U.S.R. Murty (Eds.), Graph Theory and Related Topics, 1979, pp. 341-355.
13. Tamir A. On the core of network synthesis games. Math. Programming Ser. A. 50(1):1991;123-135.
14. Tutte W.T. A short proof of the factor theorem for finite graphs. Canad. J. Math. 6:1954;347-352.
15. Yannakakis M. Expressing combinatorial optimization problems by linear programs. J. Comput. System Sci. 43:1991;441-466.