A new approach to proving upper bounds for MAX-2-SAT.
Arist KojevnikovAlexander S. KulikovPublished in: SODA (2006)
Keyphrases
- max sat
- upper bound
- lower bound
- branch and bound algorithm
- branch and bound
- weighted max sat
- upper and lower bounds
- lower and upper bounds
- variable ordering
- stochastic local search
- randomly generated
- max sat solver
- maximum satisfiability
- np hard
- satisfiability problem
- sat problem
- cutting plane
- sat solvers
- column generation
- sample complexity
- unsatisfiable cores
- cnf formula
- search tree
- objective function
- search algorithm
- constraint satisfaction
- search strategies
- model checking
- optimal solution
- random sat instances
- genetic algorithm