A branch-and-cut algorithm for nonconvex quadratic programs with box constraints.

Dieter Vandenbussche George L. Nemhauser

Published in: Math. Program. (2005)

Keyphrases

optimal solution
improved algorithm
np hard
recognition algorithm
learning algorithm
objective function
dynamic programming
linear programming
feature selection
computational complexity
search space
simulated annealing
expectation maximization
metaheuristic