A Comparison between MPI and OpenMP Branch-and-Bound Skeletons.
Isabel DortaCoromoto LeónCasiano RodríguezPublished in: IPDPS (2003)
Keyphrases
- branch and bound
- shared memory
- lower bound
- branch and bound algorithm
- search algorithm
- search space
- high performance computing
- upper bound
- combinatorial optimization
- optimal solution
- column generation
- branch and bound procedure
- message passing interface
- branch and bound search
- tree search
- branch and bound method
- parallel programming
- message passing
- randomly generated problems
- parallel algorithm
- tree search algorithm
- parallel computing
- network design problem
- beam search
- massively parallel
- search strategies
- depth first search
- distributed memory
- linear programming relaxation
- parallel execution
- search tree
- linear programming
- lagrangian heuristic
- parallel implementation
- search strategy
- scheduling problem