Curriculum-based course timetabling with SAT and MaxSAT.
Roberto Javier Asín AcháRobert NieuwenhuisPublished in: Ann. Oper. Res. (2014)
Keyphrases
- sat solvers
- constraint satisfaction
- sat problem
- boolean satisfiability
- maximum satisfiability
- constraint satisfaction problems
- propositional satisfiability
- max sat
- sat solving
- sat instances
- orders of magnitude
- phase transition
- high school
- satisfiability problem
- search tree
- np complete
- branch and bound algorithm
- search space
- search strategies
- professional development
- randomly generated
- probabilistic planning
- clause learning
- stochastic local search
- sat encodings
- boolean optimization
- cooperative learning
- heuristic search
- lower bound
- constraint programming
- upper bound
- computer science curriculum
- combinatorial optimization
- decision problems
- np hard
- stochastic local search algorithms
- objective function