A Generalised Branch-and-Bound Approach and Its Application in SAT Modulo Nonlinear Integer Arithmetic.
Gereon KremerFlorian CorziliusErika ÁbrahámPublished in: CASC (2016)
Keyphrases
- branch and bound
- integer arithmetic
- search algorithm
- max sat
- sat problem
- lower bound
- branch and bound algorithm
- search space
- search strategies
- column generation
- upper bound
- combinatorial optimization
- branch and bound procedure
- optimal solution
- satisfiability problem
- branch and bound search
- branch and bound method
- randomly generated problems
- tree search
- sat solvers
- euclidean distance transform
- beam search
- network design problem
- bnb adopt
- lagrangian heuristic
- tree search algorithm
- search tree