DNA based algorithms for solving both MAX-SAT and MAX-W-SAT problems.
Souhila SadegHabiba DriasHafid AidSamir MazouzPublished in: BIC-TA (2010)
Keyphrases
- max sat
- sat problem
- stochastic local search
- weighted max sat
- sat solvers
- np complete problems
- satisfiability problem
- sat solving
- random sat instances
- maximum satisfiability
- sat instances
- propositional satisfiability
- phase transition
- data structure
- variable ordering
- boolean satisfiability
- search algorithm
- tabu search
- orders of magnitude
- constraint satisfaction problems
- lower bound
- combinatorial optimization
- branch and bound algorithm
- constraint satisfaction
- graph coloring
- upper bound
- np complete
- computational complexity
- branch and bound