Combining ordered best-first search with branch and bound for exact BDD minimization.
Rüdiger EbendtWolfgang GüntherRolf DrechslerPublished in: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. (2005)
Keyphrases
- branch and bound
- search algorithm
- lower bound
- branch and bound algorithm
- optimal solution
- beam search
- column generation
- upper bound
- branch and bound search
- combinatorial optimization
- tree search
- search space
- objective function
- branch and bound procedure
- randomly generated problems
- branch and bound method
- exact solution
- depth first search
- lagrangian heuristic
- integer programming problems
- tree search algorithm
- network design problem
- search strategies
- linear programming relaxation
- search problems
- neural network
- mixed integer programming
- partial solutions
- heuristic search
- optimization problems