Tight Bound on Johnson's Algoritihm for Max-SAT.
Jianer ChenDonald K. FriesenHao ZhengPublished in: Computational Complexity Conference (1997)
Keyphrases
- max sat
- lower bound
- upper bound
- branch and bound algorithm
- branch and bound
- weighted max sat
- worst case
- np hard
- variable ordering
- optimal solution
- unsatisfiable cores
- stochastic local search
- maximum satisfiability
- objective function
- boolean satisfiability
- search tree
- randomly generated
- satisfiability problem
- column generation
- special case
- evolutionary algorithm
- random sat instances
- max sat solver