.png){kind=icon}
.png){kind=icon}
Return
Integer programming techniques for the nurse rostering problem
.png){kind=icon}
PRE
AI
DOI：10.1007/s10479-014-1594-6.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Nurse rostering
Integer programming
Cutting planes
MIP heuristics
Journal
IF:
4.5
Papers:
8.0K
Citations:
2.1W