Dellepiane, Umberto; Palagi, Laura - In: European Journal of Operational Research 241 (2015) 3, pp. 596-605
The Standard Quadratic Problem (StQP) is an NP-hard problem with many local minimizers (stationary points). In the literature, heuristics based on unconstrained continuous non-convex formulations have been proposed (Bomze & Palagi, 2005; Bomze, Grippo, & Palagi, 2012) but none dominates the other in...
