Efficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SAT: Experimental Evaluation.
Mutsunori YagiuraToshihide IbarakiPublished in: J. Heuristics (2001)
Keyphrases
- objective function
- max sat
- lower bound
- search algorithm
- experimental evaluation
- optimal solution
- branch and bound
- branch and bound algorithm
- linear programming
- tabu search
- weighted max sat
- upper bound
- satisfiability problem
- sat solvers
- test collection
- particle swarm optimization
- search methods
- temporal logic
- inference rules
- special case
- boolean satisfiability
- variable ordering
- search space