A new polynomially solvable class of quadratic optimization problems with box constraints.

Milan Hladík Michal Cerný Miroslav Rada

Published in: Optim. Lett. (2021)

Keyphrases

polynomially solvable
quadratic optimization problems
np complete
special case
processing times
np hard
constraint satisfaction
constrained optimization
potential functions
cost function
co occurrence