Branch-and-bound parallelization strategies applied to a depot location and container fleet management problem.
Benoît BourbeauTeodor Gabriel CrainicBernard GendronPublished in: Parallel Comput. (2000)
Keyphrases
- branch and bound
- search algorithm
- lower bound
- fleet management
- branch and bound algorithm
- optimal solution
- upper bound
- search strategies
- column generation
- search space
- combinatorial optimization
- randomly generated problems
- tree search
- network design problem
- parallel processing
- beam search
- depth first search
- branch and bound procedure
- lagrangian heuristic