Integer programming techniques for the nurse rostering problem.

Registro completo de metadados
MetadadosDescriçãoIdioma
Autor(es): dc.creatorSantos, Haroldo Gambini-
Autor(es): dc.creatorToffolo, Túlio Ângelo Machado-
Autor(es): dc.creatorGomes, Rafael Antonio Marques-
Autor(es): dc.creatorRibas, Sabir-
Data de aceite: dc.date.accessioned2025-08-21T15:04:46Z-
Data de disponibilização: dc.date.available2025-08-21T15:04:46Z-
Data de envio: dc.date.issued2017-02-21-
Data de envio: dc.date.issued2017-02-21-
Data de envio: dc.date.issued2016-
Fonte completa do material: dc.identifierhttp://www.repositorio.ufop.br/handle/123456789/7298-
Fonte completa do material: dc.identifierhttp://link.springer.com/article/10.1007/s10479-014-1594-6-
Fonte completa do material: dc.identifierhttps://doi.org/10.1007/s10479-014-1594-6-
Fonte: dc.identifier.urihttp://educapes.capes.gov.br/handle/capes/1002042-
Descrição: dc.descriptionThis work presents integer programming techniques to tackle the problem of the International Nurse Rostering Competition. Starting from a compact and monolithic formulation in which the current generation of solvers performs poorly, improved cut generation strategies and primal heuristics are proposed and evaluated. A large number of computational experiments with these techniques produced the following results: the optimality of the vast majority of instances was proved, the best known solutions were improved by up to 15 % and strong dual bounds were obtained. In the spirit of reproducible science, all code was implemented using the Computational Infrastructure for Operations Research.-
Formato: dc.formatapplication/pdf-
Idioma: dc.languageen-
Direitos: dc.rightsrestrito-
Palavras-chave: dc.subjectCutting planes-
Título: dc.titleInteger programming techniques for the nurse rostering problem.-
Aparece nas coleções:Repositório Institucional - UFOP

Não existem arquivos associados a este item.