Packing-based branch-and-bound for discrete malleable task scheduling.
Roland BraunePublished in: J. Sched. (2022)
Keyphrases
- branch and bound
- lower bound
- branch and bound algorithm
- search algorithm
- column generation
- search space
- optimal solution
- combinatorial optimization
- upper bound
- branch and bound procedure
- branch and bound method
- network design problem
- randomly generated problems
- packing problem
- beam search
- branch and bound search
- tree search
- integer programming problems
- tree search algorithm
- bnb adopt
- max sat
- partial solutions
- search strategies
- depth first search
- lagrangian heuristic
- linear programming relaxation
- scheduling algorithm
- heuristic search
- mini bucket