Strong bounds with cut and column generation for class-teacher timetabling.

dc.contributor.authorSantos, Haroldo Gambini
dc.contributor.authorUchoa, Eduardo
dc.contributor.authorOchi, Luiz Satoru
dc.contributor.authorMaculan Filho, Nelson
dc.date.accessioned2017-02-21T16:43:41Z
dc.date.available2017-02-21T16:43:41Z
dc.date.issued2012
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.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: <http://link.springer.com/article/10.1007/s10479-010-0709-y>. Acesso em: 20 fev. 2017.pt_BR
dc.identifier.doihttps://doi.org/10.1007/s10479-010-0709-y
dc.identifier.issn1572-9338
dc.identifier.urihttp://www.repositorio.ufop.br/handle/123456789/7299
dc.identifier.uri2http://link.springer.com/article/10.1007/s10479-010-0709-ypt_BR
dc.language.isoen_USpt_BR
dc.rightsrestritopt_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

Arquivos

Pacote original

Agora exibindo 1 - 1 de 1
Nenhuma Miniatura Disponível
Nome:
ARTIGO_StrongBoundsCut.pdf
Tamanho:
530.7 KB
Formato:
Adobe Portable Document Format

Licença do pacote

Agora exibindo 1 - 1 de 1
Nenhuma Miniatura Disponível
Nome:
license.txt
Tamanho:
924 B
Formato:
Item-specific license agreed upon to submission
Descrição: