A parallel branch-and-bound algorithm for integer linear programming and its implementation on a distributed multiprocessor.
Atsuko IkegamiKatsuhiro AoyagiHajime IizukaPublished in: Systems and Computers in Japan (1993)
Keyphrases
- branch and bound algorithm
- integer linear programming
- branch and bound
- boolean satisfiability
- lower bound
- column generation
- upper bound
- optimal solution
- randomly generated
- combinatorial optimization
- search tree
- parallel implementation
- lower bounding
- np hard
- randomly generated problems
- distributed memory
- precedence constraints
- upper bounding
- shared memory multiprocessor
- single machine scheduling problem
- branch and bound method
- finding an optimal solution
- shared memory
- cost function
- search algorithm
- cutting plane
- combinatorial problems
- search space