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

John van den Broek, Cor Hurkens

Onderzoeksoutput: Bijdrage aan congresPaper

8 Downloads (Pure)

Samenvatting

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.

Originele taal-2Engels
Aantal pagina's4
StatusGepubliceerd - 1 jan 2008
Evenement7th International Conference on the Practice and Theory of Automated Timetabling, (PATAT 2008) - Montreal, Canada
Duur: 18 aug 200822 aug 2008

Congres

Congres7th International Conference on the Practice and Theory of Automated Timetabling, (PATAT 2008)
Verkorte titelPATAT2008
LandCanada
StadMontreal
Periode18/08/0822/08/08

Citeer dit

van den Broek, J., & Hurkens, C. (2008). An LP-based heuristic for the post enrolment course timetabling problem of the ITC. Paper gepresenteerd op 7th International Conference on the Practice and Theory of Automated Timetabling, (PATAT 2008), Montreal, Canada.