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

Adam Kurpisz Samuli Leppänen Monaldo Mastrolilli

Published in: CoRR (2015)

Keyphrases

stable set
semidefinite
optimization methods
semidefinite programming
np hard
denoising
convex relaxation