A Taxonomy of Exact Methods for Partial Max-SAT.
Mohamed El-bachir MenaiTasniem Nasser Al-YahyaPublished in: J. Comput. Sci. Technol. (2013)
Keyphrases
- max sat
- exact algorithms
- exact methods
- branch and bound algorithm
- lower bound
- weighted max sat
- branch and bound
- sat solvers
- search algorithm
- upper bound
- tabu search
- maximum satisfiability
- sat problem
- randomly generated
- satisfiability problem
- np hard
- knapsack problem
- optimal solution
- constraint satisfaction
- cnf formula
- combinatorial problems
- approximation algorithms
- boolean satisfiability
- worst case
- integer programming
- combinatorial optimization
- linear program
- linear programming