Solving MAX-SAT with non-oblivious functions and history-based heuristics.
Roberto BattitiMarco ProtasiPublished in: Satisfiability Problem: Theory and Applications (1996)
Keyphrases
- max sat
- weighted max sat
- variable ordering
- stochastic local search
- exact algorithms
- finding optimal solutions
- search algorithm
- graph coloring
- sat solvers
- branch and bound algorithm
- lower bound
- tabu search
- satisfiability problem
- random sat instances
- propositional satisfiability
- branch and bound
- sat problem
- constraint satisfaction
- linear programming
- sat instances
- unsatisfiable cores
- sat encodings
- timetabling problem
- boolean satisfiability
- combinatorial optimization
- binary decision diagrams
- simulated annealing
- heuristic search
- unit propagation
- integer programming
- search strategies
- neural network