A faster branch-and-bound algorithm for the block relocation problem.
Shunji TanakaKenta TakiiPublished in: CASE (2014)
Keyphrases
- branch and bound algorithm
- lower bound
- branch and bound
- upper bound
- randomly generated
- np hard
- optimal solution
- precedence constraints
- test problems
- search tree
- combinatorial optimization
- single machine scheduling problem
- lower bounding
- randomly generated problems
- lagrangian relaxation
- mixed integer linear programming
- upper bounding
- variable ordering
- integer variables
- finding an optimal solution
- neural network
- search space
- high dimensional
- special case
- branch and bound method