Parallel branch and bound on fine-grained hypercube multiprocessors.
Frank DehneAfonso G. FerreiraAndrew Rau-ChaplinPublished in: TAI (1989)
Keyphrases
- branch and bound
- fine grained
- coarse grained
- shared memory
- distributed memory
- lower bound
- massively parallel
- parallel algorithm
- search algorithm
- branch and bound algorithm
- depth first search
- parallel implementation
- optimal solution
- search space
- upper bound
- column generation
- combinatorial optimization
- branch and bound procedure
- access control
- tree search
- randomly generated problems
- data parallelism
- beam search
- tree search algorithm
- branch and bound method
- parallel processing
- bnb adopt
- integer programming problems
- network design problem
- parallel computing
- lagrangian heuristic
- data lineage
- branch and bound search
- case based reasoning
- markov random field
- particle swarm optimization
- genetic algorithm
- search strategy