Pages that link to "Item:Q2294273"
From MaRDI portal
The following pages link to On lifted cover inequalities: a new lifting procedure with unusual properties (Q2294273):
Displaying 13 items.
- Knapsack polytopes: a survey (Q827125) (← links)
- On the complexity of sequentially lifting cover inequalities for the knapsack polytope (Q829120) (← links)
- Multi-cover inequalities for totally-ordered multiple knapsack sets (Q2061876) (← links)
- Scattered storage assignment: mathematical model and valid inequalities to optimize the intra-order item distances (Q2108111) (← links)
- On the complexity of separation from the knapsack polytope (Q2164691) (← links)
- Lifting the knapsack cover inequalities for the knapsack polytope (Q2661529) (← links)
- Cover by disjoint cliques cuts for the knapsack problem with conflicting items (Q2670441) (← links)
- A cut-and-branch algorithm for the quadratic knapsack problem (Q2673234) (← links)
- Multi-cover inequalities for totally-ordered multiple knapsack sets: theory and computation (Q2689829) (← links)
- Safe and Verified Gomory Mixed-Integer Cuts in a Rational Mixed-Integer Program Framework (Q6202766) (← links)
- A new sequential lifting of robust cover inequalities (Q6492454) (← links)
- On the complexity of separating cutting planes for the knapsack polytope (Q6589743) (← links)
- Two-set inequalities for the binary knapsack polyhedra (Q6670502) (← links)
