IVM-based parallel branch-and-bound using hierarchical work stealing on multi-GPU systems.
Jan GmysMohand MezmazNouredine MelabDaniel TuyttensPublished in: Concurr. Comput. Pract. Exp. (2017)
Keyphrases
- branch and bound
- branch and bound algorithm
- lower bound
- search algorithm
- upper bound
- optimal solution
- depth first search
- parallel computing
- search space
- parallel implementation
- column generation
- parallel processing
- search strategies
- combinatorial optimization
- tree search
- np hard
- network design problem
- randomly generated problems
- parallel programming
- branch and bound method
- linear programming
- graphics processing units
- max sat
- branch and bound procedure
- tree search algorithm