On the Hardest Problem Formulations for the 0/1 0 / 1 Lasserre Hierarchy

@article{Kurpisz2015OnTH,
  title={On the Hardest Problem Formulations for the 0/1 0 / 1 Lasserre Hierarchy},
  author={Adam Kurpisz and Samuli Lepp{\"a}nen and Monaldo Mastrolilli},
  journal={ArXiv},
  year={2015},
  volume={abs/1510.01891}
}
  • Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli
  • Published 2015
  • Computer Science, Mathematics
  • ArXiv
  • The Lasserre/Sum-of-Squares (SoS) hierarchy is a systematic procedure for constructing a sequence of increasingly tight semidefinite relaxations. It is known that the hierarchy converges to the 0/1 polytope in n levels and captures the convex relaxations used in the best available approximation algorithms for a wide variety of optimization problems. In this paper we characterize the set of 0/1 integer linear problems and unconstrained 0/1 polynomial optimization problems that can still have an… CONTINUE READING
    1
    Twitter Mention

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 10 CITATIONS

    High Degree Sum of Squares Proofs, Bienstock-Zuckerberg hierarchy and Chvatal-Gomory cuts

    • Monaldo Mastrolilli
    • Computer Science, Mathematics
    • Electronic Colloquium on Computational Complexity
    • 2017

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 41 REFERENCES

    Approximation Algorithms Using Hierarchies of Semidefinite Programming Relaxations

    • Eden Chlamtác
    • Mathematics, Computer Science
    • 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07)
    • 2007
    VIEW 1 EXCERPT

    Computation of the Lasserre Ranks of Some Polytopes

    VIEW 6 EXCERPTS
    HIGHLY INFLUENTIAL