A dynamic branch and bound approach for robotic rescheduling with randomly arriving jobs.
Pengyu YanXiaoqiang CaiZhen ZhouXiaowo TangPublished in: ICNSC (2013)
Keyphrases
- branch and bound
- lower bound
- branch and bound algorithm
- search algorithm
- column generation
- optimal solution
- search space
- tree search algorithm
- upper bound
- combinatorial optimization
- branch and bound procedure
- tree search
- randomly generated problems
- lagrangian heuristic
- beam search
- processing times
- data streams
- partial solutions
- depth first search
- linear programming relaxation
- network design problem
- branch and bound method
- integer programming problems
- np hard
- branch and bound search
- search strategies