Pages that link to "Item:Q943790"
From MaRDI portal
The following pages link to Approximate formulations for 0-1 knapsack sets (Q943790):
Displayed 6 items.
- Tightening simple mixed-integer sets with guaranteed bounds (Q431027) (← links)
- Some \(0/1\) polytopes need exponential size extended formulations (Q2434987) (← links)
- A note on the extension complexity of the knapsack polytope (Q2450664) (← links)
- Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack (Q3009771) (← links)
- Extended formulations in combinatorial optimization (Q5900907) (← links)
- Extended formulations in combinatorial optimization (Q5919994) (← links)