A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs.
Jeff T. LinderothPublished in: Math. Program. (2005)
Keyphrases
- branch and bound algorithm
- combinatorial optimization
- finding an optimal solution
- lower bound
- branch and bound
- optimal solution
- upper bound
- np hard
- lagrangian relaxation
- max sat
- exact solution
- worst case
- convex optimization
- semidefinite programming
- quadratically constrained quadratic
- special case
- interior point methods
- semi infinite
- bayesian networks