On the set covering polytope. II: Lifting the facets with coefficients in \ 0,1,2\
From MaRDI portal
DOI10.1007/BF01589093zbMATH Open0692.90073MaRDI QIDQ584072FDOQ584072
Authors: E. Balas, Shu Ming Ng 
Publication date: 1989
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
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}
Combinatorial optimization (90C27) Integer programming (90C10) Polytopes and polyhedra (52Bxx) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Properties of vertex packing and independence system polyhedra
- On the facial structure of set packing polyhedra
- 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
- Title not available (Why is that?)
- Lifting the facets of zero–one polytopes
- Title not available (Why is that?)
Cited In (15)
- A parallel genetic algorithm to solve the set-covering problem
- Transitive packing
- Title not available (Why is that?)
- Facetas del politopo de recubrimiento con coeficientes en {0, 1, 2, 3}
- Set covering approach for reconstruction of sibling relationships
- 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\(\}\)
- The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems
- Enhancing an algorithm for set covering problems
- Integer programming methods for solving binary interdiction games
- Computational experience with general cutting planes for the set covering problem
- Experiments with LAGRASP heuristic for set \(k\)-covering
- Requiring connectivity in the set covering problem
- Integer programming approach to static monopolies in graphs
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)
