Pages that link to "Item:Q1306471"
From MaRDI portal
The following pages link to The complexity of cover inequality separation (Q1306471):
Displaying 19 items.
- Implicit cover inequalities (Q266036) (← links)
- Cutting planes for the multistage stochastic unit commitment problem (Q291049) (← links)
- Knapsack polytopes: a survey (Q827125) (← links)
- On the complexity of sequentially lifting cover inequalities for the knapsack polytope (Q829120) (← links)
- Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes (Q951099) (← links)
- Optimization algorithms for the disjunctively constrained knapsack problem (Q1797814) (← links)
- A cut-and-solve based algorithm for the single-source capacitated facility location problem (Q1926885) (← links)
- Pitch, extension complexity, and covering problems (Q2060545) (← links)
- On the exact separation of cover inequalities of maximum-depth (Q2115307) (← links)
- On the complexity of separation from the knapsack polytope (Q2164691) (← links)
- Packing, partitioning, and covering symresacks (Q2192122) (← links)
- Strengthening convex relaxations of 0/1-sets using Boolean formulas (Q2235155) (← links)
- Sparsity of integer formulations for binary programs (Q2294334) (← links)
- Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem (Q2462108) (← links)
- Simple lifted cover inequalities and hard knapsack problems (Q2581317) (← links)
- Separation algorithms for 0-1 knapsack polytopes (Q2638369) (← links)
- On inequalities with bounded coefficients and pitch for the min knapsack polytope (Q2673233) (← links)
- Multi-cover inequalities for totally-ordered multiple knapsack sets: theory and computation (Q2689829) (← links)
- Branch-and-cut-and-price algorithm for the constrained-routing and spectrum assignment problem (Q6495886) (← links)
