Hardness of some optimization problems over correlation polyhedra

Alberto Caprara, Fabio Furini, Claudio Gentile +2

We prove the \textbf{NP}-hardness, using Karp reductions, of some problems related to the correlation polytope and its corresponding cone, spanned by all of the $n\times n$ rank-on…