Pages that link to "Item:Q2976145"

The following pages link to On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy (Q2976145):

Displayed 9 items.

• Theoretical challenges towards cutting-plane selection (Q1650776) ‎ (← links)
• Lift \& project systems performing on the partial-vertex-cover polytope (Q1989348) ‎ (← 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)
• 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)
• Sum of Squares Bounds for the Empty Integral Hull Problem (Q6081967) ‎ (← links)