On the 0, 1 facets of the set covering polytope
- 1 January 1989
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 43 (1) , 45-55
- https://doi.org/10.1007/bf01582277
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Ki-covers I: Complexity and polytopesDiscrete Mathematics, 1986
- On the Uncapacitated Plant Location Problem. II: Facets and Lifting TheoremsMathematics of Operations Research, 1983
- Some facets of the simple plant location polytopeMathematical Programming, 1982
- 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
- Critical Cutsets of Graphs and Canonical Facets of Set-Packing PolytopesMathematics of Operations Research, 1977
- Set Partitioning: A surveySIAM Review, 1976
- On certain polytopes associated with graphsJournal of Combinatorial Theory, Series B, 1975
- On balanced matricesPublished by Springer Nature ,1974
- Balanced matricesMathematical Programming, 1972