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

Registro completo de metadados
MetadadosDescriçãoIdioma
Autor(es): dc.creatorSantos, Haroldo Gambini-
Autor(es): dc.creatorUchoa, Eduardo-
Autor(es): dc.creatorOchi, Luiz Satoru-
Autor(es): dc.creatorMaculan Filho, Nelson-
Data de aceite: dc.date.accessioned2025-08-21T15:39:24Z-
Data de disponibilização: dc.date.available2025-08-21T15:39:24Z-
Data de envio: dc.date.issued2017-02-21-
Data de envio: dc.date.issued2017-02-21-
Data de envio: dc.date.issued2012-
Fonte completa do material: dc.identifierhttp://www.repositorio.ufop.br/handle/123456789/7299-
Fonte completa do material: dc.identifierhttp://link.springer.com/article/10.1007/s10479-010-0709-y-
Fonte completa do material: dc.identifierhttps://doi.org/10.1007/s10479-010-0709-y-
Fonte: dc.identifier.urihttp://educapes.capes.gov.br/handle/capes/1020799-
Descrição: dc.descriptionThis 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.-
Formato: dc.formatapplication/pdf-
Idioma: dc.languageen-
Direitos: dc.rightsrestrito-
Palavras-chave: dc.subjectInteger programming-
Título: dc.titleStrong bounds with cut and column generation for class-teacher timetabling.-
Aparece nas coleções:Repositório Institucional - UFOP

Não existem arquivos associados a este item.