An asynchronous parallel branch-and-bound algorithm.
Tsuyoshi KawaguchiHiroshi MasuyamaTamotsu MaedaPublished in: Systems and Computers in Japan (1992)
Keyphrases
- branch and bound algorithm
- lower bound
- branch and bound
- upper bound
- np hard
- test problems
- lower bounding
- search tree
- asynchronous cellular automata
- optimal solution
- upper bounding
- combinatorial optimization
- precedence constraints
- randomly generated problems
- max sat
- single machine scheduling problem
- branch and bound method
- mixed integer linear programming
- lagrangian relaxation
- finding an optimal solution
- approximation algorithms
- lower and upper bounds
- search algorithm
- maximum clique
- mathematical programming
- special case
- neural network