Improved Branch and Bound Algorithms for Max-2-SAT and Weighted Max-2-SAT.
Jordi PlanesPublished in: CP (2003)
Keyphrases
- max sat
- branch and bound algorithm
- weighted max sat
- branch and bound
- lower bound
- boolean satisfiability
- upper bound
- randomly generated
- np hard
- graph coloring
- optimal solution
- variable ordering
- stochastic local search
- sat solvers
- search tree
- exact algorithms
- combinatorial optimization
- constraint satisfaction
- integer programming
- particle swarm optimization
- satisfiability problem
- combinatorial problems
- sat problem
- cnf formula
- probabilistic planning
- search algorithm
- objective function