Lower bounds for the ITC-2007 curriculum-based course timetabling problem.
Jin-Kao HaoUna BenlicPublished in: Eur. J. Oper. Res. (2011)
Keyphrases
- timetabling problem
- lower bound
- memetic algorithm
- upper bound
- hyper heuristics
- examination timetabling
- branch and bound
- branch and bound algorithm
- lower and upper bounds
- objective function
- high school
- worst case
- np hard
- vc dimension
- optimal solution
- genetic programming
- artificial intelligence
- professional development
- tabu search
- elementary school
- search space
- graph coloring