On the set covering polytope: I. All the facets with coefficients in {0, 1, 2}
- 1 January 1989
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 43 (1-3) , 57-69
- https://doi.org/10.1007/bf01582278
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Edmonds polytopes and a hierarchy of combinatorial problemsPublished by Elsevier ,2002
- Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational studyPublished by Springer Nature ,1980
- Cutting planes from conditional bounds: A new approach to set coveringPublished by Springer Nature ,1980
- Lifting the facets of zero–one polytopesMathematical Programming, 1978
- Set Partitioning: A surveySIAM Review, 1976
- Facet of regular 0–1 polytopesMathematical Programming, 1975
- Properties of vertex packing and independence system polyhedraMathematical Programming, 1974
- On the facial structure of set packing polyhedraMathematical Programming, 1973