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.
| Language | English |
|---|---|
| Number of pages | 4 |
| State | 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 | Canada |
| City | Montreal |
| Period | 18/08/08 → 22/08/08 |
Cite this
}
An LP-based heuristic for the post enrolment course timetabling problem of the ITC. / van den Broek, John; Hurkens, Cor.
2008. Paper presented at 7th International Conference on the Practice and Theory of Automated Timetabling, (PATAT 2008), Montreal, Canada.Research output: Contribution to conference › Paper › Academic
TY - CONF
T1 - An LP-based heuristic for the post enrolment course timetabling problem of the ITC
AU - van den Broek,John
AU - Hurkens,Cor
PY - 2008/1/1
Y1 - 2008/1/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85067198341&partnerID=8YFLogxK
M3 - Paper
ER -