A new branch and bound algorithm for noncovex quadratic programming with box constraints.
Wenlong FuTingsong DuPublished in: FSKD (2013)
Keyphrases
- branch and bound algorithm
- quadratic programming
- lower bound
- precedence constraints
- linear programming
- branch and bound
- np hard
- optimal solution
- upper bound
- integer variables
- upper bounding
- lower and upper bounds
- lagrangian relaxation
- combinatorial optimization
- knapsack problem
- ls svm
- particle swarm optimization
- finding an optimal solution
- np complete
- optical flow
- objective function