Author:
Aguilera Néstor E.,Bianchi Silvia M.,Nasini Graciela L.
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference6 articles.
1. A lift-and-project cutting plane algorithm for mixed 0–1 programs;Balas;Math. Programming,1993
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. Maximum matching and a polyhedron with 0,1 vertices;Edmonds;J. Res. Nat. Bureau Standards,1965
4. When does the positive semidefiniteness constraint help in lifting procedures?;Goemans;Math. Oper. Res.,2001
5. Cones of matrices and set-functions and 0–1 optimization;Lovász;SIAM J. Optim.,1991
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献