Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/s10479-014-1594-6 | Annals of Operations Research |
Keywords | Field | DocType |
Nurse rostering,Integer programming,Cutting planes,MIP heuristics | Mathematical optimization,Nursing,Nurse scheduling problem,Heuristics,Integer programming,Mathematics | Journal |
Volume | Issue | ISSN |
239 | 1 | 0254-5330 |
Citations | PageRank | References |
24 | 0.98 | 25 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Haroldo Gambini Santos | 1 | 50 | 4.08 |
| Túlio A. M. Toffolo | 2 | 24 | 0.98 |
| Rafael A. M. Gomes | 3 | 25 | 1.33 |
| Sabir Ribas | 4 | 31 | 3.20 |