An efficient branch-and-bound algorithm using an adaptive branching rule with quadratic convex relaxation for globally solving general linear multiplicative programs.
Yanzhen ZhangPeiping ShenBingdi HuangYaping DengPublished in: J. Comput. Appl. Math. (2024)
Keyphrases
- branch and bound algorithm
- branch and bound
- convex relaxation
- variable ordering
- semidefinite
- combinatorial optimization
- lower bound
- integer variables
- optimal solution
- upper bound
- finding an optimal solution
- special case
- search algorithm
- multistage
- convex optimization
- np hard
- search space
- objective function
- quadratic program