Computation of the Lasserre Ranks of Some Polytopes
From MaRDI portal
Publication:5388017
DOI10.1287/MOOR.1060.0212zbMATH Open1278.90331OpenAlexW2096547979MaRDI QIDQ5388017FDOQ5388017
Authors: Kevin K. H. Cheung 
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
Recommendations
- A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
- Rank bounds for a hierarchy of Lovász and Schrijver
- Lower Bound for the Number of Iterations in Semidefinite Hierarchies for the Cut Polytope
- On the hardest problem formulations for the 0/1 Lasserre hierarchy
- On the hardest problem formulations for the \(0/1\) Lasserre hierarchy
Cited In (16)
- Handelman rank of zero-diagonal quadratic programs over a hypercube and its applications
- Lift \& project systems performing on the partial-vertex-cover polytope
- Rank of Handelman hierarchy for Max-Cut
- Theoretical challenges towards cutting-plane selection
- On the hardest problem formulations for the \(0/1\) Lasserre hierarchy
- Sum-of-squares bounds via Boolean function analysis
- On the rank of Suzuki polytopes: an answer to Hubard and Leemans
- On the hardest problem formulations for the 0/1 Lasserre hierarchy
- Elementary polytopes with high lift-and-project ranks for strong positive semidefinite operators
- Title not available (Why is that?)
- Sum of Squares Bounds for the Empty Integral Hull Problem
- An unbounded sum-of-squares hierarchy integrality gap for a polynomially solvable problem
- A comprehensive analysis of polyhedral lift-and-project methods
- Complexity analyses of Bienstock-Zuckerberg and lasserre relaxations on the matching and stable set polytopes
- Rank bounds for a hierarchy of Lovász and Schrijver
- Optimization over the Boolean hypercube via sums of nonnegative circuit polynomials
Uses Software
This page was built for publication: Computation of the Lasserre Ranks of Some Polytopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5388017)
