A feasibility-pump-style alternating heuristic with dynamic convexification and parallel local branching finds feasible solutions for three previously unsolved QPLIB instances and improves best-known solutions for fifteen others within five minutes.
Mathematical Programming Computation4(1), 1–31 (2012) 32
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
An Alternating Primal Heuristic for Nonconvex MIQCQP with Dynamic Convexification and Parallel Local Branching
A feasibility-pump-style alternating heuristic with dynamic convexification and parallel local branching finds feasible solutions for three previously unsolved QPLIB instances and improves best-known solutions for fifteen others within five minutes.