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.
|Status||Gepubliceerd - 1 jan 2008|
|Evenement||7th International Conference on the Practice and Theory of Automated Timetabling, (PATAT 2008) - Montreal, Canada|
Duur: 18 aug 2008 → 22 aug 2008
|Congres||7th International Conference on the Practice and Theory of Automated Timetabling, (PATAT 2008)|
|Periode||18/08/08 → 22/08/08|