Lower bounds and compact mathematical formulations for spacing soft constraints for university examination timetabling problems.
Taha ArbaouiJean Paul BouffletAziz MoukrimPublished in: Comput. Oper. Res. (2019)
Keyphrases
- soft constraints
- timetabling problem
- lower bound
- upper bound
- hard constraints
- memetic algorithm
- integer programming formulations
- constraint satisfaction
- constraint propagation
- constraint satisfaction problems
- examination timetabling
- np hard
- objective function
- hyper heuristics
- branch and bound
- branch and bound algorithm
- arc consistency
- cutting plane
- worst case
- max sat
- partial constraint satisfaction
- image segmentation
- lower and upper bounds
- valid inequalities
- genetic algorithm
- computational complexity
- constraint problems
- constraint violations
- optimal solution