Combining ordered best-first search with branch and bound for exact BDD minimization.
Rüdiger EbendtWolfgang GüntherRolf DrechslerPublished in: ASP-DAC (2004)
Keyphrases
- branch and bound
- search algorithm
- lower bound
- branch and bound algorithm
- optimal solution
- column generation
- search space
- upper bound
- branch and bound search
- combinatorial optimization
- beam search
- branch and bound method
- objective function
- tree search
- network design problem
- branch and bound procedure
- randomly generated problems
- exact solution
- tree search algorithm
- bnb adopt
- search strategies
- depth first search
- lagrangian heuristic
- mini bucket
- max sat
- partial solutions
- boolean functions
- heuristic search