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

Por favor, use este identificador para citar o enlazar este ítem: http://www.repositorio.ufop.br/jspui/handle/123456789/7299

Título :	Strong bounds with cut and column generation for class-teacher timetabling.
Autor :	Santos, Haroldo Gambini Uchoa, Eduardo Ochi, Luiz Satoru Maculan Filho, Nelson
Palabras clave :	Integer programming
Fecha de publicación :	2012
Citación :	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.
Resumen :	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
Aparece en las colecciones:	DECOM - Artigos publicados em periódicos

Ficheros en este ítem:

Fichero	Descripción	Tamaño	Formato
ARTIGO_StrongBoundsCut.pdf Until 2062-02-20		530,7 kB	Adobe PDF	Visualizar/Abrir