Decomposition Methods for Solving Nonconvex Quadratic Programs via Branch and Bound.
Riccardo CambiniClaudio SodiniPublished in: J. Glob. Optim. (2005)
Keyphrases
- branch and bound
- decomposition methods
- quadratic program
- convex optimization
- combinatorial optimization
- lower bound
- objective function
- tree decomposition
- branch and bound algorithm
- search algorithm
- integer programming problems
- optimal solution
- linear program
- decomposition method
- linear constraints
- nonlinear programming
- branch and bound search
- search space
- column generation
- upper bound
- branch and bound procedure
- linear programming
- quadratic programming
- constraint satisfaction problems
- optimization problems
- approximation algorithms
- bnb adopt
- maximum margin
- metaheuristic
- mixed integer
- database theory
- np hard
- simulated annealing
- worst case
- neural network
- lagrangian dual
- decomposition algorithm
- support vector
- machine learning