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

DOI10.1007/BF01589093zbMath0692.90073MaRDI QIDQ584072

Egon 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

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

Related Items

The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems, Facetas del politopo de recubrimiento con coeficientes en {0, 1, 2, 3}, Integer programming methods for solving binary interdiction games, Transitive packing, Enhancing an algorithm for set covering problems, Integer programming approach to static monopolies in graphs, Experiments with LAGRASP heuristic for set \(k\)-covering, Requiring connectivity in the set covering problem, Set covering approach for reconstruction of sibling relationships, Computational experience with general cutting planes for the set covering problem, A parallel genetic algorithm to solve the set-covering problem

Cites Work

• Unnamed Item
• Unnamed Item
• On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\)
• On the 0,1 facets of the set covering polytope
• On the facial structure of the set covering polytope
• Edmonds polytopes and a hierarchy of combinatorial problems
• Lifting the facets of zero–one polytopes
• Properties of vertex packing and independence system polyhedra
• On the facial structure of set packing polyhedra