Towards an abstract parallel branch and bound machine.
Arie de BruinGerard A. P. KindervaterHarry W. J. M. TrienekensPublished in: Solving Combinatorial Optimization Problems in Parallel (1996)
Keyphrases
- branch and bound
- search algorithm
- lower bound
- branch and bound algorithm
- depth first search
- search space
- optimal solution
- column generation
- upper bound
- combinatorial optimization
- branch and bound procedure
- randomly generated problems
- beam search
- branch and bound method
- tree search algorithm
- tree search
- search strategies
- lagrangian heuristic
- parallel processing
- network design problem
- neural network
- metaheuristic
- np hard
- reduce the search space
- max sat
- bnb adopt
- mini bucket
- heuristic search