Pages that link to "Item:Q3541786"
From MaRDI portal
The following pages link to Improved Approximation Guarantees through Higher Levels of SDP Hierarchies (Q3541786):
Displayed 15 items.
- Wireless capacity with arbitrary gain matrix (Q742412) (← links)
- Independent sets in semi-random hypergraphs (Q832900) (← links)
- Elementary polytopes with high lift-and-project ranks for strong positive semidefinite operators (Q1662113) (← links)
- Optimization over the Boolean hypercube via sums of nonnegative circuit polynomials (Q2143214) (← links)
- Optimization and operations research in mitigation of a pandemic (Q2158111) (← links)
- Integrality gaps for colorful matchings (Q2419586) (← links)
- A Comprehensive Analysis of Polyhedral Lift-and-Project Methods (Q2790405) (← links)
- Convex Relaxations and Integrality Gaps (Q2802523) (← links)
- On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy (Q2976145) (← links)
- Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack (Q3009771) (← links)
- On the Hardest Problem Formulations for the $$0/1$$ Lasserre Hierarchy (Q3448844) (← links)
- A (1+epsilon)-Approximation for Makespan Scheduling with Precedence Constraints Using LP Hierarchies (Q4997320) (← links)
- (Q5005186) (← links)
- (Q5091238) (← links)
- (Q5743407) (← links)