Enhancing sequential depth computation with a branch-and-bound algorithm.
Chia-Chih YenJing-Yang JouPublished in: HLDVT (2004)
Keyphrases
- branch and bound algorithm
- lower bound
- branch and bound
- upper bound
- lower bounding
- combinatorial optimization
- np hard
- precedence constraints
- search tree
- optimal solution
- test problems
- randomly generated problems
- single machine scheduling problem
- mixed integer linear programming
- branch and bound method
- lagrangian relaxation
- upper bounding
- variable ordering
- neural network
- finding an optimal solution
- max sat
- maximum clique
- constraint satisfaction problems
- particle swarm optimization
- special case
- search algorithm