Pages that link to "Item:Q1306471"
From MaRDI portal
The following pages link to The complexity of cover inequality separation (Q1306471):
Displaying 9 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)
- Branch-and-cut-and-price algorithm for the constrained-routing and spectrum assignment problem (Q6495886) (← links)
