Strong bounds with cut and column generation for class-teacher timetabling.
No Thumbnail Available
Date
2012
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
This work presents an integer programming formulation for a variant of the ClassTeacher
Timetabling problem, which considers the satisfaction of teacher preferences and
also the proper distribution of lessons throughout the week. The formulation contains a very
large number of variables and is enhanced by cuts. Therefore, a cut and column generation
algorithm to solve its linear relaxation is provided. The lower bounds obtained are very
good, allowing us to prove the optimality of previously known solutions in three formerly
open instances.
Description
Keywords
Integer programming
Citation
SANTOS, H. G. et al. Strong bounds with cut and column generation for class-teacher timetabling. Annals of Operation Research, v. 194, n. 1, p. 399-412, abr. 2012. Disponível em: <http://link.springer.com/article/10.1007/s10479-010-0709-y>. Acesso em: 20 fev. 2017.