DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs.
Cheng LuZhibin DengPublished in: Optim. Lett. (2018)
Keyphrases
- branch and bound algorithm
- quadratic program
- branch and bound
- lower bound
- upper bound
- optimal solution
- decomposition algorithm
- np hard
- search tree
- approximation algorithms
- combinatorial optimization
- set covering problem
- linear program
- boolean satisfiability
- finding an optimal solution
- linear constraints
- linear programming
- mixed integer
- haplotype inference
- convex optimization
- decomposition method
- search algorithm
- objective function
- column generation
- quadratic programming
- scheduling problem
- feature selection
- constraint satisfaction
- maximum margin
- state space
- search space