Please use this identifier to cite or link to this item: http://www.repositorio.ufop.br/handle/123456789/7299
Title: Strong bounds with cut and column generation for class-teacher timetabling.
Authors: Santos, Haroldo Gambini
Uchoa, Eduardo
Ochi, Luiz Satoru
Maculan Filho, Nelson
Keywords: Integer programming
Issue Date: 2012
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.
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.
URI: http://www.repositorio.ufop.br/handle/123456789/7299
metadata.dc.identifier.uri2: http://link.springer.com/article/10.1007/s10479-010-0709-y
metadata.dc.identifier.doi: https://doi.org/10.1007/s10479-010-0709-y
ISSN: 1572-9338
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.