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