On the set covering polytope: Facets with coefficients in \(\{0,1,2,3\}\)

DOI10.1023/A:1018969410431zbMath0911.90285MaRDI QIDQ1265897

M. I. Sobrón, M. Sánchez-García, Begoña Vitoriano

Publication date: 27 September 1998

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

combinatorial optimizationvalid inequalitiesset coveringfacetspolyhedral combinatorics

Mathematics Subject Classification ID

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

Related Items

Integer programming methods for solving binary interdiction games ⋮ The Football Pool Polytope ⋮ Integer programming approach to static monopolies in graphs ⋮ Requiring connectivity in the set covering problem ⋮ Solving the close-enough arc routing problem ⋮ On the structure of linear programs with overlapping cardinality constraints