Approximating Max NAE-k-SAT by anonymous local search.
Aiyong XianKaiyuan ZhuDaming ZhuLianrong PuHong LiuPublished in: Theor. Comput. Sci. (2017)
Keyphrases
- stochastic local search
- propositional satisfiability
- search algorithm
- satisfiability testing
- sat solvers
- search strategies
- search procedures
- sat solving
- satisfiability problem
- search space
- random sat instances
- sat problem
- global search
- sat instances
- tabu search
- propositional logic
- genetic algorithm
- tree search
- simulated annealing
- constraint programming
- stochastic local search algorithms
- search procedure
- max sat
- job shop scheduling problem
- memetic algorithm
- systematic search
- boolean satisfiability
- phase transition
- randomly generated
- neighborhood search
- scheduling problem
- optimal solution
- combinatorial optimization
- branch and bound
- search methods
- search problems