An effective branch-and-bound algorithm for the maximum s-bundle problem.
Yi ZhouWeibo LinJin-Kao HaoMingyu XiaoYan JinPublished in: Eur. J. Oper. Res. (2022)
Keyphrases
- branch and bound algorithm
- lower bound
- branch and bound
- lower bounding
- upper bound
- precedence constraints
- search tree
- np hard
- single machine scheduling problem
- randomly generated
- test problems
- branch and bound method
- combinatorial optimization
- mixed integer linear programming
- randomly generated problems
- upper bounding
- optimal solution
- neural network
- finding an optimal solution
- lagrangian relaxation
- column generation
- search space
- bayesian networks