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 language | English |
|---|---|
| Number of pages | 4 |
| Publication status | Published - 1 Jan 2008 |
| Event | 7th International Conference on the Practice and Theory of Automated Timetabling, (PATAT 2008) - Montreal, Canada Duration: 18 Aug 2008 → 22 Aug 2008 |
Conference
| Conference | 7th International Conference on the Practice and Theory of Automated Timetabling, (PATAT 2008) |
|---|---|
| Abbreviated title | PATAT2008 |
| Country/Territory | Canada |
| City | Montreal |
| Period | 18/08/08 → 22/08/08 |