Pages that link to "Item:Q3448844"
From MaRDI portal
The following pages link to On the Hardest Problem Formulations for the $$0/1$$ Lasserre Hierarchy (Q3448844):
Displaying 6 items.
- Sum-of-squares rank upper bounds for matching problems (Q1631641) (← links)
- Elementary polytopes with high lift-and-project ranks for strong positive semidefinite operators (Q1662113) (← links)
- An unbounded sum-of-squares hierarchy integrality gap for a polynomially solvable problem (Q1683679) (← links)
- Sum-of-squares hierarchy lower bounds for symmetric formulations (Q2191774) (← links)
- A Lasserre Lower Bound for the Min-Sum Single Machine Scheduling Problem (Q3452846) (← links)
- Exact Semidefinite Programming Relaxations with Truncated Moment Matrix for Binary Polynomial Optimization Problems (Q5737720) (← links)
