An Adaptative Multi-GPU Based Branch-and-Bound. A Case Study: The Flow-Shop Scheduling Problem.
Imen ChakrounNouredine MelabPublished in: HPCC-ICESS (2012)
Keyphrases
- branch and bound
- lower bound
- branch and bound algorithm
- search algorithm
- optimal solution
- search space
- upper bound
- column generation
- combinatorial optimization
- branch and bound method
- lagrangian heuristic
- beam search
- tree search
- branch and bound procedure
- network design problem
- partial solutions
- branch and bound search
- randomly generated problems
- tree search algorithm
- search strategies
- depth first search
- tree decomposition
- linear programming relaxation
- convex hull
- objective function