On the set covering polytope. II: Lifting the facets with coefficients in \ 0,1,2\

DOI10.1007/BF01589093MaRDI QIDQ584072zbMATH OpenFDO

Authors E. Balas, Shu Ming Ng

Publication date 1989

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

facet liftingset covering polytope

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Integer programming (90C10) Polytopes and polyhedra (52Bxx) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\)
• On the set covering polytope: Facets with coefficients in \(\{0,1,2,3\}\)
• Lifted cover facets of the 0-1 knapsack polytope with GUB constraints
• Facets and lifting procedures for the set covering polytope
• Facetas del politopo de recubrimiento con coeficientes en {0, 1, 2, 3}

Cites work

• scientific article; zbMATH DE number 3874956 (Why is no real title available?)
• scientific article; zbMATH DE number 3566549 (Why is no real title available?)
• Edmonds polytopes and a hierarchy of combinatorial problems
• Lifting the facets of zero–one polytopes
• On the 0,1 facets of the set covering polytope
• On the facial structure of set packing polyhedra
• On the facial structure of the set covering polytope
• On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\)
• Properties of vertex packing and independence system polyhedra

Cited in

(16)

• Tilted inequalities and facets of the set covering polytope: a theoretical analysis
• Requiring connectivity in the set covering problem
• Facetas del politopo de recubrimiento con coeficientes en {0, 1, 2, 3}
• Computational experience with general cutting planes for the set covering problem
• A parallel genetic algorithm to solve the set-covering problem
• scientific article; zbMATH DE number 3874956 (Why is no real title available?)
• Experiments with LAGRASP heuristic for set \(k\)-covering
• Facets and lifting procedures for the set covering polytope
• On the 0,1 facets of the set covering polytope
• On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\)
• Integer programming approach to static monopolies in graphs
• Enhancing an algorithm for set covering problems
• Transitive packing
• Integer programming methods for solving binary interdiction games
• Set covering approach for reconstruction of sibling relationships
• The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems

This page was built for publication: On the set covering polytope. II: Lifting the facets with coefficients in \(\{\) 0,1,2\(\}\)

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