Author:
Nobili Paolo,Sassano Antonio
Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference26 articles.
1. E. Balas, “Facets of the knapscak polytope,”Mathematical Programming 8 (1975) 146–164.
2. E. Balas, “Cutting planes from conditional bounds: a new approach to set covering,”Mathematical Programming Study 12 (1980) 19–36.
3. E. Balas and A.C. Ho, “Set covering algorithms using cutting planes, heuristics, and subgradient optimization: a computational study,”Mathematical Programming Study 12 (1980) 37–60.
4. E. Balas and S.M. Ng, “On the set covering polytope: I. All the facets with coefficients in {0, 1, 2},” Management Science Research Report n. MSRR-522, Graduate School of Industrial Administration, Carnegie Mellon University (Pittsburgh, PA, 1986).
5. E. Balas and E. Zemel, “Facets of the knapsack polytope from minimal covers,”SIAM Journal on Applied Mathematics 34 (1978) 119–148.
Cited by
36 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献