A New Upper Bound for Max-2-Sat: A Graph-Theoretic Approach
Daniel RaibleHenning FernauPublished in: CoRR (2008)
Keyphrases
- max sat
- upper bound
- lower bound
- branch and bound algorithm
- branch and bound
- weighted max sat
- worst case
- tabu search
- variable ordering
- np hard
- maximum satisfiability
- boolean satisfiability
- stochastic local search
- search algorithm
- cnf formula
- search tree
- randomly generated
- satisfiability problem
- unsatisfiable cores
- max sat solver
- sat solvers
- optimal solution
- column generation
- linear programming
- computational complexity
- objective function
- combinatorial problems
- sat problem
- genetic algorithm
- heuristic search
- orders of magnitude