Pages that link to "Item:Q2401179"
From MaRDI portal
The following pages link to High degree sum of squares proofs, Bienstock-Zuckerberg hierarchy and CG cuts (Q2401179):
Displaying 9 items.
- Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
- Pitch, extension complexity, and covering problems (Q2060545) (← links)
- Optimization over the Boolean hypercube via sums of nonnegative circuit polynomials (Q2143214) (← links)
- Breaking symmetries to rescue sum of squares in the case of makespan scheduling (Q2196315) (← links)
- Strengthening convex relaxations of 0/1-sets using Boolean formulas (Q2235155) (← links)
- On inequalities with bounded coefficients and pitch for the min knapsack polytope (Q2673233) (← links)
- (Q5005186) (← links)
- (Q5091238) (← links)
- High Degree Sum of Squares Proofs, Bienstock--Zuckerberg Hierarchy, and Chvátal--Gomory Cuts (Q5853720) (← links)