A tighter upper bound for random MAX 2-SAT.
XueLin XuZongsheng GaoKe XuPublished in: Inf. Process. Lett. (2011)
Keyphrases
- upper bound
- max sat
- lower bound
- branch and bound algorithm
- branch and bound
- weighted max sat
- randomly generated
- random sat instances
- variable ordering
- optimal solution
- maximum satisfiability
- stochastic local search
- np hard
- boolean satisfiability
- max sat solver
- sat solvers
- satisfiability problem
- search algorithm
- search tree
- tabu search
- unsatisfiable cores
- sat problem
- column generation
- propositional satisfiability
- simulated annealing