Sign in

A branch-and-cut procedure for the Udine Course Timetabling problem.

Edmund K. BurkeJakub MarecekAndrew J. ParkesHana Rudová
Published in: Ann. Oper. Res. (2012)
Keyphrases
  • timetabling problem
  • memetic algorithm
  • hyper heuristics
  • examination timetabling
  • objective function
  • expert systems
  • database
  • data sets
  • learning algorithm
  • dynamic programming