.png){kind=icon}
返回
Integer programming techniques for the nurse rostering problem
.png){kind=icon}
PRE
AI
DOI：10.1007/s10479-014-1594-6.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Nurse rostering
Integer programming
Cutting planes
MIP heuristics
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.5
论文数:
8.1K
被引数:
2.1W
机构
引用论文
A tabu search approach to the constraint satisfaction problem as a general problem solver作为一般问题解决者的约束满足问题的禁忌搜索方法
PREAI
分享收藏分享收藏Alginate surfactant derivatives as an ecofriendly corrosion inhibitor for carbon steel in acidic environments.png)
RSC Advances
RSC AdvancesIF0
PREAI
分享收藏
分享收藏
查看更多内容