A provable better Branch and Bound method for a nonconvex integer quadratic programming problem.
Wenxing ZhuPublished in: J. Comput. Syst. Sci. (2005)
Keyphrases
- branch and bound method
- branch and bound
- mixed integer programming
- reduce the search space
- lower bound
- optimal configuration
- branch and bound algorithm
- feasible solution
- objective function
- convex optimization
- global optimization
- computationally efficient
- column generation
- upper bound
- combinatorial optimization
- linear programming
- optimization problems
- search space
- search algorithm
- mixed integer
- tabu search
- nonlinear programming
- quadratic optimization problems
- mathematical model
- supervised learning
- np hard
- decision making
- genetic algorithm
- dynamic programming
- evolutionary algorithm
- optimal solution
- training data