An LP-based heuristic for the post enrolment course timetabling problem of the ITC

John van den Broek, Cor Hurkens

Research output: Contribution to conferencePaper

10 Downloads (Pure)

Abstract

We present a deterministic heuristic for the post enrolment course timetabling problem of the ITC. The heuristic is based on an LP-solution constructed with column generation. We get an integer solution by fixing a column one at a time. Our results are compared with the results of the five finalists.

Original languageEnglish
Number of pages4
Publication statusPublished - 1 Jan 2008
Event7th International Conference on the Practice and Theory of Automated Timetabling, (PATAT 2008) - Montreal, Canada
Duration: 18 Aug 200822 Aug 2008

Conference

Conference7th International Conference on the Practice and Theory of Automated Timetabling, (PATAT 2008)
Abbreviated titlePATAT2008
Country/TerritoryCanada
CityMontreal
Period18/08/0822/08/08

Cite this