MPI and OpenMPI implementations of Branch-and-Bound Skeletons.
Isabel DortaCoromoto LeónCasiano RodríguezAngélica RojasPublished in: PARCO (2003)
Keyphrases
- branch and bound
- branch and bound algorithm
- search algorithm
- lower bound
- search space
- upper bound
- optimal solution
- column generation
- combinatorial optimization
- message passing
- branch and bound procedure
- beam search
- parallel algorithm
- randomly generated problems
- parallel implementation
- tree search algorithm
- search strategies
- network design problem
- lagrangian heuristic
- branch and bound method
- shared memory
- tree search
- state space
- branch and bound search
- partial solutions
- objective function
- bnb adopt
- distributed memory
- depth first search
- parallel programming
- max sat
- simulated annealing
- tabu search
- integer programming problems
- mini bucket