Pages that link to "Item:Q1201098"
From MaRDI portal
The following pages link to The complexity of lifted inequalities for the knapsack problem (Q1201098):
Displaying 15 items.
- Knapsack polytopes: a survey (Q827125) (← links)
- On the complexity of sequentially lifting cover inequalities for the knapsack polytope (Q829120) (← links)
- Sequence independent lifting for mixed knapsack problems with GUB constraints (Q896279) (← links)
- Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes (Q951099) (← links)
- Adjacency of the 0-1 knapsack problem (Q1195107) (← links)
- Polyhedral results for the precedence-constrained knapsack problem (Q1208480) (← links)
- Lifting valid inequalities for the precedence constrained knapsack problem (Q1806031) (← links)
- An \(O(n \log n)\) procedure for identifying facets of the knapsack polytope. (Q1811629) (← links)
- Lifted cover facets of the 0-1 knapsack polytope with GUB constraints (Q1890949) (← links)
- On lifted cover inequalities: a new lifting procedure with unusual properties (Q2294273) (← links)
- Simple lifted cover inequalities and hard knapsack problems (Q2581317) (← links)
- Lifting the knapsack cover inequalities for the knapsack polytope (Q2661529) (← links)
- On inequalities with bounded coefficients and pitch for the min knapsack polytope (Q2673233) (← links)
- Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack (Q3009771) (← links)
- Lifted Cover Inequalities for 0-1 Integer Programs: Complexity (Q4427368) (← links)