A branch and bound algorithm for quantified quadratic programming.
Ferenc DomesAlexandre GoldsztejnPublished in: J. Glob. Optim. (2017)
Keyphrases
- quadratic programming
- branch and bound algorithm
- lower bound
- linear programming
- branch and bound
- np hard
- optimal solution
- upper bound
- combinatorial optimization
- upper bounding
- support vector machine
- single machine scheduling problem
- lagrangian relaxation
- finding an optimal solution
- ls svm
- search space
- column generation