On the set covering polytope. II: Lifting the facets with coefficients in \ 0,1,2\
From MaRDI portal
[For part I see the authors, ibid. A 43, No.1, 57-69 (1989; Zbl 0674.90079.] The class of facets of the set covering polytope defined by inequalities with coefficients from \(\{\) 0,1,2\(\}\) is characterized by the theory of facet lifting. A lot of examples are given.
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
- Edmonds polytopes and a hierarchy of combinatorial problems
- scientific article; zbMATH DE number 3874956 (Why is no real title available?)
- scientific article; zbMATH DE number 3566549 (Why is no real title available?)
- 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
(19)- Computational experience with general cutting planes for the set covering problem
- 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
- Facets and lifting procedures for the set covering polytope
- Enhancing an algorithm for set covering problems
- On the set covering polytope: Facets with coefficients in \(\{0,1,2,3\}\)
- The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems
- A parallel genetic algorithm to solve the set-covering problem
- Integer programming approach to static monopolies in graphs
- Requiring connectivity in the set covering problem
- Integer programming methods for solving binary interdiction games
- scientific article; zbMATH DE number 3874956 (Why is no real title available?)
- Facetas del politopo de recubrimiento con coeficientes en {0, 1, 2, 3}
- Transitive packing
- Set covering approach for reconstruction of sibling relationships
- Tilted inequalities and facets of the set covering polytope: a theoretical analysis
- On a geometric graph-covering problem related to optimal safety-landing-site location
- Experiments with LAGRASP heuristic for set \(k\)-covering
- An initial polyhedral study of the football pool problem
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)
