Parallel Branch-and-Bound using private IVM-based work stealing on Xeon Phi MIC coprocessor.
Nouredine MelabRudi LeroyMohand MezmazDaniel TuyttensPublished in: HPCS (2015)
Keyphrases
- branch and bound
- depth first search
- search algorithm
- lower bound
- branch and bound algorithm
- massively parallel
- upper bound
- optimal solution
- search space
- column generation
- combinatorial optimization
- randomly generated problems
- branch and bound method
- tree search
- branch and bound procedure
- search strategies
- network design problem
- branch and bound search
- tree search algorithm
- beam search
- integer programming problems
- parallel processing
- lagrangian heuristic
- linear programming relaxation
- max sat
- reduce the search space
- shared memory
- search tree
- bnb adopt
- genetic algorithm