A branch and bound approach for large pre-marshalling problems.
Shunji TanakaKevin TierneyConsuelo Parreño-TorresRamón Alvarez-ValdésRubén RuizPublished in: Eur. J. Oper. Res. (2019)
Keyphrases
- branch and bound
- randomly generated problems
- lower bound
- branch and bound procedure
- search algorithm
- branch and bound algorithm
- partial solutions
- optimal solution
- combinatorial optimization
- upper bound
- integer programming problems
- search space
- branch and bound method
- previously solved
- column generation
- max sat
- branch and bound search
- network design problem
- mixed integer programming
- linear programming relaxation
- tree search
- objective function
- search problems
- mathematical programming
- lagrangian heuristic
- multiple knapsack