Recognizing facet defining inequalities

MaRDI QIDQ1384420zbMATH OpenFDO

Authors E. Balas

Publication date 20 September 1998

Published in Acta Mathematica Vietnamica (Search for Journal in Brave)

zbMATH Keywords

0-1 polytopefacet defining inequalitiesset coveringvalid inequalityvertex packing

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Combinatorial optimization (90C27)

Recommendations

• On the 0,1 facets of the set covering polytope
• Facet generating techniques
• Generating facets for the independence system polytope
• On the set covering polytope: Facets with coefficients in \(\{0,1,2,3\}\)

Cited in

(6)

• On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\)
• ``Facet separation with one linear program
• Facet generating techniques
• A branch-and-cut algorithm for the truck dock assignment problem with operational time constraints
• Generating facets for the independence system polytope
• On facet-inducing inequalities for combinatorial polytopes

This page was built for publication: Recognizing facet defining inequalities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1384420)