Local Max-Resolution in Branch and Bound Solvers for Max-SAT.
André AbraméDjamal HabetPublished in: ICTAI (2014)
Keyphrases
- max sat
- branch and bound
- unit propagation
- maximum satisfiability
- branch and bound algorithm
- lower bound
- search algorithm
- sat solvers
- clause learning
- weighted max sat
- upper bound
- optimal solution
- search space
- combinatorial optimization
- sat problem
- column generation
- branch and bound procedure
- search strategies
- max sat solver
- branch and bound method
- tree search
- beam search
- boolean satisfiability
- satisfiability problem
- sat instances
- cnf formula
- propositional satisfiability
- traveling salesman problem
- heuristic search
- tabu search