Computation of the Lasserre Ranks of Some Polytopes
From MaRDI portal
Publication:5388017
DOI10.1287/moor.1060.0212zbMath1278.90331OpenAlexW2096547979MaRDI QIDQ5388017
Publication date: 27 May 2008
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.1060.0212
Related Items
On the Hardest Problem Formulations for the $$0/1$$ Lasserre Hierarchy, Optimization over the Boolean hypercube via sums of nonnegative circuit polynomials, Theoretical challenges towards cutting-plane selection, Handelman rank of zero-diagonal quadratic programs over a hypercube and its applications, Elementary polytopes with high lift-and-project ranks for strong positive semidefinite operators, An unbounded sum-of-squares hierarchy integrality gap for a polynomially solvable problem, Sum of Squares Bounds for the Empty Integral Hull Problem, Rank of Handelman hierarchy for Max-Cut, Sum-of-squares hierarchy lower bounds for symmetric formulations, Unnamed Item, On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy, Rank bounds for a hierarchy of Lovász and Schrijver, Complexity Analyses of Bienstock–Zuckerberg and Lasserre Relaxations on the Matching and Stable Set Polytopes, Lift \& project systems performing on the partial-vertex-cover polytope, Unnamed Item, A Comprehensive Analysis of Polyhedral Lift-and-Project Methods
Uses Software
