Integer programming techniques for the nurse rostering problem.
Nenhuma Miniatura disponível
Data
2016
Título da Revista
ISSN da Revista
Título de Volume
Editor
Resumo
This 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.
Descrição
Palavras-chave
Cutting planes
Citação
SANTOS, H. G. et al. Integer programming techniques for the nurse rostering problem. Annals of Operation Research, v. 239, n. 1, p. 225-251, abr. 2016. Disponível em: <http://link.springer.com/article/10.1007/s10479-014-1594-6>. Acesso em: 20 fev. 2017.