Pages that link to "Item:Q584072"
From MaRDI portal
The following pages link to On the set covering polytope. II: Lifting the facets with coefficients in \(\{\) 0,1,2\(\}\) (Q584072):
Displaying 15 items.
- Experiments with LAGRASP heuristic for set \(k\)-covering (Q691433) (← links)
- Computational experience with general cutting planes for the set covering problem (Q1002077) (← links)
- On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\) (Q1121793) (← links)
- On the 0,1 facets of the set covering polytope (Q1122477) (← links)
- Facets and lifting procedures for the set covering polytope (Q1123808) (← links)
- Enhancing an algorithm for set covering problems (Q1194745) (← links)
- On the set covering polytope: Facets with coefficients in \(\{0,1,2,3\}\) (Q1265897) (← links)
- The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems (Q1333026) (← links)
- A parallel genetic algorithm to solve the set-covering problem (Q1603319) (← links)
- Integer programming approach to static monopolies in graphs (Q1752610) (← links)
- Requiring connectivity in the set covering problem (Q1774524) (← links)
- Integer programming methods for solving binary interdiction games (Q2672065) (← links)
- Facetas del politopo de recubrimiento con coeficientes en {0, 1, 2, 3} (Q4022746) (← links)
- Transitive packing (Q4645940) (← links)
- Set covering approach for reconstruction of sibling relationships (Q5758164) (← links)
