A New Upper Bound for Max-2-SAT: A Graph-Theoretic Approach.
Daniel RaibleHenning FernauPublished in: MFCS (2008)
Keyphrases
- max sat
- upper bound
- lower bound
- branch and bound algorithm
- branch and bound
- weighted max sat
- np hard
- boolean satisfiability
- worst case
- optimal solution
- sat solvers
- tabu search
- objective function
- stochastic local search
- maximum satisfiability
- randomly generated
- column generation
- satisfiability problem
- cnf formula
- combinatorial problems
- search tree
- sat problem
- genetic algorithm
- linear programming
- variable ordering
- multi objective
- learning algorithm