An Adaptative Multi-GPU based Branch-and-Bound. A Case Study: the Flow-Shop Scheduling Problem
Imen ChakrounNouredine MelabPublished in: CoRR (2012)
Keyphrases
- branch and bound
- lower bound
- branch and bound algorithm
- search algorithm
- upper bound
- column generation
- optimal solution
- search space
- combinatorial optimization
- branch and bound search
- beam search
- tree search
- network design problem
- randomly generated problems
- branch and bound method
- depth first search
- branch and bound procedure
- lagrangian heuristic
- tree search algorithm
- objective function
- max sat
- search strategies
- linear programming relaxation
- tree decomposition
- genetic algorithm
- partial solutions
- simulated annealing
- dynamic programming
- bnb adopt