Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSantos, Haroldo Gambini-
dc.contributor.authorUchoa, Eduardo-
dc.contributor.authorOchi, Luiz Satoru-
dc.contributor.authorMaculan Filho, Nelson-
dc.identifier.citationSANTOS, 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: <>. Acesso em: 20 fev. 2017.pt_BR
dc.description.abstractThis 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.pt_BR
dc.subjectInteger programmingpt_BR
dc.titleStrong bounds with cut and column generation for class-teacher timetabling.pt_BR
dc.typeArtigo publicado em periodicopt_BR
Appears in Collections:DECOM - Artigos publicados em periódicos

Files in This Item:
File Description SizeFormat 
ARTIGO_StrongBoundsCut.pdf530,7 kBAdobe PDFView/Open    Request a copy

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.