Felix Lieder

Learn More
A reformulation of quadratically constrained binary programs as duals of set-copositive linear optimization problems is derived using either {0, 1}-formulations or {1, 1}-formulations. The latter representation allows an extension of the randomization technique by Goemans and Williamson. An application to the max-clique problem shows that the max-clique(More)
  • 1