Lift and project relaxations for the matching and related polytopes

Discrete Applied Mathematics

Volumn 134, Issue 1-3, 2004, Pages 193-212

  Aguilera, Néstor E ^a   Bianchi, Silvia M ^b   Nasini, Graciela L ^b  

^a Instituto de Desarrollo Tecnologico para la Industria Quimica   (Argentina)

^b UNIVERSIDAD NACIONAL DE ROSARIO   (Argentina)

Author keywords

Covering; Matching; Polyhedral combinatorics; Sequential tightening procedures

Indexed keywords

COMPUTATIONAL GEOMETRY; CONSTRAINT THEORY; MATRIX ALGEBRA; PROBLEM SOLVING; THEOREM PROVING;

POLYTOPES;

GRAPH THEORY;

EID: 0242271908     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(03)00337-8     Document Type: Article

References (6)

1. Balas E., Ceria S., Cornuéjols G. A lift-and-project cutting plane algorithm for mixed 0-1 programs. Math. Programming. 58:1993;295-324.
2. M.L. Balinski, On maximum matching, minimum covering and their connections, in: H. Kuhn (Ed.), Proceedings of the Princeton Symposium on Mathematical Programming, 1970, pp. 303-312.
3. Edmonds J. Maximum matching and a polyhedron with 0,1 vertices. J. Res. Nat. Bureau Standards. 69 B:1965;125-130.
4. Goemans M.X., Tunçel L. When does the positive semidefiniteness constraint help in lifting procedures? Math. Oper. Res. 26(4):2001;796-815.
5. Lovász L., Schrijver A. Cones of matrices and set-functions and 0-1 optimization. SIAM J. Optim. 1:1991;166-190.
6. Stephen T., Tunçel L. On a representation of the matching polytope via semidefinite liftings. Math. Oper. Res. 24:1999;1-7.