A new branch and bound method with pretreatment for the binary quadratic programming.
Xuewen MuYaling ZhangSanyang LiuPublished in: Appl. Math. Comput. (2007)
Keyphrases
- quadratic programming
- branch and bound method
- linear programming
- feasible solution
- branch and bound
- branch and bound algorithm
- mixed integer programming
- reduce the search space
- lower bound
- optimal configuration
- machine learning
- support vector machine
- optimal solution
- upper bound
- column generation
- search space
- linear program
- maximum likelihood
- lagrangian relaxation
- objective function
- neural network