Lift and project relaxations for the matching and related polytopes

Balas, 1993, A lift-and-project cutting plane algorithm for mixed 0–1 programs, Math. Programming, 58, 295, 10.1007/BF01581273 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. Edmonds, 1965, Maximum matching and a polyhedron with 0,1 vertices, J. Res. Nat. Bureau Standards, 69 B, 125, 10.6028/jres.069B.013 Goemans, 2001, When does the positive semidefiniteness constraint help in lifting procedures?, Math. Oper. Res., 26, 796, 10.1287/moor.26.4.796.10012 Lovász, 1991, Cones of matrices and set-functions and 0–1 optimization, SIAM J. Optim., 1, 166, 10.1137/0801013 Stephen, 1999, On a representation of the matching polytope via semidefinite liftings, Math. Oper. Res., 24, 1, 10.1287/moor.24.1.1