Semidefinite Relaxations for Integer Programming

  title={Semidefinite Relaxations for Integer Programming},
  author={Franz Rendl},
  booktitle={50 Years of Integer Programming},
We survey some recent developments in the area of semidefinite optimization applied to integer programming. After recalling some generic modeling techniques to obtain semidefinite relaxations for NP-hard problems, we look at the theoretical power of semidefinite optimization in the context of the Max-Cut and the Coloring Problem. In the second part, we consider algorithmic questions related to semidefinite optimization, and point to some recent ideas to handle large scale problems. The survey… CONTINUE READING