On a Hybrid MPI-Pthread Approach for Simplicial Branch-and-Bound.
Juan F. R. HerreraLeocadio G. CasadoRemigijus PaulaviciusJulius ZilinskasEligius M. T. HendrixPublished in: IPDPS Workshops (2013)
Keyphrases
- branch and bound
- branch and bound algorithm
- lower bound
- search space
- search algorithm
- optimal solution
- upper bound
- combinatorial optimization
- column generation
- branch and bound procedure
- beam search
- branch and bound method
- branch and bound search
- tree search
- search strategies
- parallel algorithm
- randomly generated problems
- network design problem
- parallel implementation
- tree search algorithm
- lagrangian heuristic
- depth first search
- message passing
- linear programming relaxation
- partial solutions
- shared memory
- integer programming problems
- dynamic programming
- parallel tree search
- parallel processing
- search strategy
- np hard