A Simplicial Branch-and-Bound Method for Solving Nonconvex All-Quadratic Programs.
Ulrich RaberPublished in: J. Glob. Optim. (1998)
Keyphrases
- quadratic program
- branch and bound method
- convex optimization
- mixed integer programming
- mixed integer
- objective function
- linear constraints
- linear program
- quadratic programming
- lower bound
- nonlinear programming
- branch and bound
- linear programming
- reduce the search space
- feasible solution
- optimal configuration
- approximation algorithms
- maximum margin
- branch and bound algorithm
- combinatorial optimization
- convex sets
- optimal solution
- lower and upper bounds
- column generation
- optimization problems
- upper bound
- dynamic programming
- evolutionary algorithm