An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming.
Peiping ShenDianxiao WuYafei WangPublished in: J. Comput. Appl. Math. (2023)
Keyphrases
- branch and bound algorithm
- branch and bound
- search tree
- lower bound
- variable ordering
- test problems
- upper bound
- search algorithm
- integer variables
- optimal solution
- lower bounding
- combinatorial optimization
- np hard
- precedence constraints
- randomly generated problems
- lagrangian relaxation
- branch and bound method
- search space
- mixed integer linear programming
- upper bounding
- column generation
- network design problem
- single machine scheduling problem
- max sat
- maximum clique
- finding an optimal solution
- partial order
- metaheuristic
- dynamic programming
- cost function