Pages that link to "Item:Q3009771"
From MaRDI portal
The following pages link to Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack (Q3009771):
Displayed 8 items.
- A ``joint + marginal'' heuristic for 0/1 programs (Q1928265) (← links)
- A Comprehensive Analysis of Polyhedral Lift-and-Project Methods (Q2790405) (← links)
- Convex Relaxations and Integrality Gaps (Q2802523) (← links)
- Sum-of-Squares Rank Upper Bounds for Matching Problems (Q2835696) (← links)
- On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy (Q2976145) (← links)
- On the Hardest Problem Formulations for the $$0/1$$ Lasserre Hierarchy (Q3448844) (← links)
- Approximation Limits of Linear Programs (Beyond Hierarchies) (Q3449458) (← links)
- A Lasserre Lower Bound for the Min-Sum Single Machine Scheduling Problem (Q3452846) (← links)