Pages that link to "Item:Q1811629"
From MaRDI portal
The following pages link to An \(O(n \log n)\) procedure for identifying facets of the knapsack polytope. (Q1811629):
Displaying 6 items.
- Cover and pack inequalities for (mixed) integer programming (Q817174) (← links)
- A concise characterization of strong knapsack facets (Q1634771) (← links)
- A polyhedral study on 0-1 knapsack problems with set packing constraints (Q1785756) (← links)
- Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack (Q3009771) (← links)
- Easily Computable Facets of the Knapsack Polytope (Q3032082) (← links)
- Construction de facettes pour le polytope du sac-à-dos quadratique en 0-1 (Q5479831) (← links)