Pages that link to "Item:Q1121793"
From MaRDI portal
The following pages link to On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\) (Q1121793):
Displayed 19 items.
- On the set covering polytope. II: Lifting the facets with coefficients in \(\{\) 0,1,2\(\}\) (Q584072) (← links)
- The anti-join composition and polyhedra (Q688264) (← links)
- Airline crew scheduling: state-of-the-art (Q817210) (← links)
- Solving the asymmetric traveling purchaser problem (Q867540) (← links)
- A comparison of formulations and solution methods for the minimum-envy location problem (Q1000990) (← links)
- Computational experience with general cutting planes for the set covering problem (Q1002077) (← links)
- Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results (Q1015318) (← links)
- On the 0,1 facets of the set covering polytope (Q1122477) (← links)
- On cutting-plane proofs in combinatorial optimization (Q1123134) (← links)
- Facets and lifting procedures for the set covering polytope (Q1123808) (← links)
- Enhancing an algorithm for set covering problems (Q1194745) (← links)
- Directed Steiner problems with connectivity constraints (Q1315992) (← 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)
- Requiring connectivity in the set covering problem (Q1774524) (← links)
- How to recycle your facets (Q2506820) (← links)
- The Football Pool Polytope (Q3503533) (← links)
- Facetas del politopo de recubrimiento con coeficientes en {0, 1, 2, 3} (Q4022746) (← links)
- Set covering approach for reconstruction of sibling relationships (Q5758164) (← links)