Bomze, Immanuel M.; Grippo, Luigi; Palagi, Laura - Dipartimento di Ingegneria Informatica, Automatica e … - 2010
A standard quadratic optimization problem (StQP) consists of nding the largest or smallest value of a (possibly indenite) quadratic form over the standard simplex which is the intersection of a hyperplane with the positive orthant. This NP-hard problem has several immediate real-world...