All the Facets of Zero-One Programming Polytopes with Positive Coefficients.
Abstract
The authors give a linear characterization of 0-1 programming polytopes with positive coefficients, by showing that every non-trival facet of such a polytope can be obtained from a minimal cover for P, or for a polytope obtained from P by complementing some of the variables, via a generalized facet lifting procedure.
Document Details
- Document Type
- Technical Report
- Publication Date
- Oct 01, 1975
- Accession Number
- ADA018189
Entities
People
- Egon Balas
- Eitan Zemel
Organizations
- Carnegie Mellon University