A multilevel hyper-heuristic for solving Max-SAT.
Mourad LassouaouiDalila BoughaciBelaid BenhamouPublished in: Int. J. Metaheuristics (2017)
Keyphrases
- max sat
- graph coloring
- weighted max sat
- examination timetabling
- hyper heuristics
- timetabling problem
- stochastic local search
- sat solvers
- tabu search
- variable ordering
- lower bound
- sat problem
- search algorithm
- branch and bound algorithm
- satisfiability problem
- constraint satisfaction
- search procedure
- constraint satisfaction problems
- genetic programming
- evolutionary algorithm
- random sat instances
- combinatorial problems
- difficult problems
- branch and bound
- orders of magnitude
- maximum satisfiability
- sat instances
- boolean satisfiability
- linear programming
- constraint programming
- combinatorial optimization