IVM-Based Work Stealing for Parallel Branch-and-Bound on GPU.
Jan GmysMohand MezmazNouredine MelabDaniel TuyttensPublished in: PPAM (1) (2015)
Keyphrases
- branch and bound
- parallel implementation
- lower bound
- branch and bound algorithm
- search algorithm
- depth first search
- parallel computation
- parallel processing
- column generation
- search space
- upper bound
- parallel programming
- parallel computing
- optimal solution
- combinatorial optimization
- graphics processing units
- beam search
- branch and bound method
- tree search
- search strategies
- branch and bound procedure
- randomly generated problems
- tree search algorithm
- integer programming problems
- max sat
- network design problem
- shared memory
- lagrangian heuristic
- branch and bound search
- linear programming relaxation