Use este identificador para citar ou linkar para este item:
http://www.repositorio.ufop.br/jspui/handle/123456789/7298
Título: | Integer programming techniques for the nurse rostering problem. |
Autor(es): | Santos, Haroldo Gambini Toffolo, Túlio Ângelo Machado Gomes, Rafael Antonio Marques Ribas, Sabir |
Palavras-chave: | Cutting planes |
Data do documento: | 2016 |
Referência: | 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. |
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. |
URI: | http://www.repositorio.ufop.br/handle/123456789/7298 |
Link para o artigo: | http://link.springer.com/article/10.1007/s10479-014-1594-6 |
DOI: | https://doi.org/10.1007/s10479-014-1594-6 |
ISSN: | 1572-9338 |
Aparece nas coleções: | DECOM - Artigos publicados em periódicos |
Arquivos associados a este item:
Arquivo | Descrição | Tamanho | Formato | |
---|---|---|---|---|
ARTIGO_IntegerProgrammingTechniques.pdf Until 2066-02-20 | 765,96 kB | Adobe PDF | Visualizar/Abrir |
Os itens no repositório estão protegidos por copyright, com todos os direitos reservados, salvo quando é indicado o contrário.