Pages that link to "Item:Q943790"

The following pages link to Approximate formulations for 0-1 knapsack sets (Q943790):

Displaying 13 items.

• On the mixing set with a knapsack constraint (Q291057) (← links)
• Tightening simple mixed-integer sets with guaranteed bounds (Q431027) (← links)
• Knapsack polytopes: a survey (Q827125) (← links)
• Simple extensions of polytopes (Q896292) (← links)
• On the existence of compact $\varepsilon$-approximated formulations for knapsack in the original space (Q1785373) (← links)
• Evolution of new algorithms for the binary knapsack problem (Q2003461) (← links)
• Some \(0/1\) polytopes need exponential size extended formulations (Q2434987) (← links)
• A note on the extension complexity of the knapsack polytope (Q2450664) (← links)
• On inequalities with bounded coefficients and pitch for the min knapsack polytope (Q2673233) (← links)
• Semi-Infinite Relaxations for the Dynamic Knapsack Problem with Stochastic Item Sizes (Q2817835) (← links)
• Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack (Q3009771) (← links)
• (Q4612478) (← links)
• No Small Linear Program Approximates Vertex Cover Within a Factor 2 − <i>ɛ</i> (Q5219712) (← links)