An improved branch and bound algorithm for exact BDD minimization.
Rüdiger EbendtWolfgang GüntherRolf DrechslerPublished in: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. (2003)
Keyphrases
- branch and bound algorithm
- lower bound
- branch and bound
- upper bound
- optimal solution
- randomly generated
- test problems
- np hard
- objective function
- lower bounding
- precedence constraints
- randomly generated problems
- combinatorial optimization
- branch and bound method
- mixed integer linear programming
- upper bounding
- single machine scheduling problem
- finding an optimal solution
- variable ordering
- binary decision diagrams
- exact methods
- boolean functions
- maximum clique
- neural network
- max sat
- lagrangian relaxation
- exact solution
- np complete