Showing 1 - 9 of 9
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/10010228240
Persistent link: https://www.econbiz.de/10010487598
Persistent link: https://www.econbiz.de/10011813002
Persistent link: https://www.econbiz.de/10012027216
Persistent link: https://www.econbiz.de/10012194139
Persistent link: https://www.econbiz.de/10012649730
Persistent link: https://www.econbiz.de/10012794421
Persistent link: https://www.econbiz.de/10012306137