Hypermetric inequalities have many applications, most recently in the approximate solution of max-cut problems by linear and semidefinite programming. However not much is known about the separation problem for these inequalities. Previously Avis and Grishukhin showed that certain special cases of the separation problem for hypermetric inequalities are NP-hard, as evidence that the separation problem is itself hard. In this paper we show that similar results hold for inequalities of negative type, even though the separation problem for negative type inequalities is well known to be solvable in polynomial time. We also show similar results hold for the more general k-gonal and gap inequalities.
Paru en janvier 2003 , 12 pages