Adaptive Branch and Bound Using SAT to Estimate False Crosstalk.
Murthy PallaJens BargfredeKlaus KochWalter AnheierRolf DrechslerPublished in: ISQED (2008)
Keyphrases
- branch and bound
- search algorithm
- max sat
- lower bound
- branch and bound algorithm
- upper bound
- search strategies
- sat problem
- optimal solution
- search space
- column generation
- branch and bound procedure
- tree search
- combinatorial optimization
- branch and bound search
- randomly generated problems
- satisfiability problem
- sat solvers
- depth first search
- branch and bound method
- network design problem
- lagrangian heuristic
- integer programming problems
- tree search algorithm
- beam search
- partial solutions
- search tree
- heuristic search
- neural network
- bnb adopt