Showing 1 - 5 of 5
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...
Persistent link: https://www.econbiz.de/10011117495
Persistent link: https://www.econbiz.de/10012024044
Persistent link: https://www.econbiz.de/10010557929
Persistent link: https://www.econbiz.de/10012520746
Persistent link: https://www.econbiz.de/10012161919