Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference9 articles.
1. E. Balas and S.M. Ng, “On the set covering polytope: I. All the facets with coefficients in {0, 1, 2},”Mathematical Programming 43 (1989) 57–69.
2. E. Balas and E. Zemel, “Lifting and complementing yields all the facets of positive zero–one programming polytopes,” in: R.W. Cottle, M.I. Kelmanson and B. Korte, eds.,Mathematical Programming (Elsevier Science Publishers, Amsterdam, 1984) pp. 13–24.
3. V. Chvátal, “Edmonds polytopes and a hierarchy of combinatorial problems,”Discrete Mathematics 4 (1973) 305–337.
4. G. Cornuejols and A. Sassano, “On the 0, 1 facets of the set covering polytope,”Mathematical Programming 43 (1989) 45–46.
5. G.L. Nemhauser and L.E. Trotter, “Properties of vertex packing and independence systems polyhedra,”Mathematical Programming 6 (1974) 48–61.
Cited by
27 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献