Author:
Dantchev Stefan,Martin Barnaby,Rhodes Mark
Subject
General Computer Science,Theoretical Computer Science
Reference15 articles.
1. R.E. Gomory, Solving linear programming problems in integers, in: R. Bellman, M. Hall (Eds.), Combinatorial Analysis, Proceedings of Symposia in Applied Mathematics, vol. 10, Providence, RI, 1960
2. Edmonds polytopes and a hierarchy of combinatorial problems;Chvátal;Discrete Math.,2006
3. Cones of matrices and set-functions and 0-1 optimization;Lovász;SIAM J. Optim.,1991
4. A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems;Sherali;SIAM J. Discrete Math.,1990
5. Rank complexity gap for Lovász–Schrijver and Sherali–Adams proof systems;Dantchev,2007
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献