High degree sum of squares proofs, Bienstock-Zuckerberg hierarchy and CG cuts

DOI10.1007/978-3-319-59250-3_33zbMath1418.90167OpenAlexW2618217717MaRDI QIDQ2401179

Monaldo Mastrolilli

Publication date: 31 August 2017

Full work available at URL: https://doi.org/10.1007/978-3-319-59250-3_33

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items (9)

Optimization over the Boolean hypercube via sums of nonnegative circuit polynomials ⋮ Theoretical challenges towards cutting-plane selection ⋮ On inequalities with bounded coefficients and pitch for the min knapsack polytope ⋮ Breaking symmetries to rescue sum of squares in the case of makespan scheduling ⋮ Unnamed Item ⋮ Strengthening convex relaxations of 0/1-sets using Boolean formulas ⋮ Unnamed Item ⋮ Pitch, extension complexity, and covering problems ⋮ High Degree Sum of Squares Proofs, Bienstock--Zuckerberg Hierarchy, and Chvátal--Gomory Cuts

This page was built for publication: High degree sum of squares proofs, Bienstock-Zuckerberg hierarchy and CG cuts