All the Facets of Zero-One Programming Polytopes with Positive Coefficients.
CARNEGIE-MELLON UNIV PITTSBURGH PA MANAGEMENT SCIENCES RESEARCH GROUP
Pagination or Media Count:
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.
- Operations Research