A multilevel synergy Thompson sampling hyper-heuristic for solving Max-SAT.
Mourad LassouaouiDalila BoughaciBelaid BenhamouPublished in: Intell. Decis. Technol. (2019)
Keyphrases
- max sat
- graph coloring
- weighted max sat
- examination timetabling
- hyper heuristics
- timetabling problem
- lower bound
- stochastic local search
- sat solvers
- tabu search
- branch and bound algorithm
- search algorithm
- variable ordering
- satisfiability problem
- constraint satisfaction
- branch and bound
- sat problem
- genetic programming
- maximum satisfiability
- metaheuristic
- random sat instances
- difficult problems
- boolean satisfiability
- evolutionary algorithm
- heuristic search
- constraint satisfaction problems
- linear programming
- upper bound
- genetic algorithm
- symmetry breaking
- sat encodings
- optimal solution
- max sat solver
- heuristic methods
- search procedure
- search tree