A new branch-and-bound algorithm for standard quadratic programming problems.
Giampaolo LiuzziMarco LocatelliVeronica PiccialliPublished in: Optim. Methods Softw. (2019)
Keyphrases
- branch and bound algorithm
- lower bound
- quadratic programming problems
- branch and bound
- upper bound
- optimal solution
- np hard
- test problems
- combinatorial optimization
- lower bounding
- single machine scheduling problem
- randomly generated problems
- upper bounding
- finding an optimal solution
- precedence constraints
- special case
- constrained optimization
- equality constraints