A Branch and Bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation.
Alain BillionnetSourour ElloumiAmélie LambertPublished in: J. Comb. Optim. (2014)
Keyphrases
- quadratic program
- mixed integer
- branch and bound algorithm
- convex optimization
- convex relaxation
- optimal solution
- linear program
- lower bound
- np hard
- branch and bound
- upper bound
- approximation algorithms
- linear programming
- linear constraints
- special case
- feasible solution
- combinatorial optimization
- lot sizing
- convex hull
- quadratic programming
- multistage
- objective function
- maximum margin
- active learning
- high dimensional
- total variation
- computational complexity