Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers.
Chu Min LiFelip ManyàJordi PlanesPublished in: CP (2005)
Keyphrases
- max sat
- unit propagation
- branch and bound
- lower bound
- branch and bound algorithm
- upper bound
- column generation
- optimal solution
- graph coloring
- search algorithm
- search space
- np hard
- stochastic local search
- lower and upper bounds
- sat problem
- search strategies
- tree search
- combinatorial optimization
- sat solvers
- cnf formula
- heuristic search
- propositional satisfiability
- boolean satisfiability
- max sat solver
- combinatorial problems
- randomly generated
- special case