arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1308.4534cs.DS
收藏

夫妻住院问题:复杂性与可持续规划模型

The Hospitals / Residents Problem with Couples: Complexity and Integer Programming Models

P. Biro, D. F. Manlove, I. McBride

摘要:

夫妇的医院/居民问题(HRC)是经典的医院/居民问题(HR)的推广,这在实际应用中很重要,因为它模拟了夫妇提交联合偏好列表的情况。在本文中,我们给出了一个新的NP-完全性的问题,决定是否存在一个稳定的匹配,在高度限制的情况下,HRC的结果。此外,我们提出了一个可编程(IP)模型HRC和扩展的情况下,偏好列表可以包括领带。此外,我们描述了一个经验研究的IP模型或HRC及其扩展的情况下,偏好列表可以包括领带。该模型被应用于随机生成的实例,以及来自苏格兰基金会分配计划的先前匹配运行的真实实例,该计划用于将初级医生分配到苏格兰的医院。

英文摘要:

The Hospitals / Residents problem with Couples (HRC) is a generalisation of the classical Hospitals / Resident problem (HR) that is important in practical applications because it models the case where couples submit joint preference lists over pairs of (typically geographically close) hospitals. In this paper we give a new NP-completeness result for the problem of deciding whether a stable matching exists, in highly restricted instances of HRC. Further, we present an Integer Programming (IP) model for HRC and extend it the case where preference lists can include ties. Also, we describe an empirical study of an IP model or HRC and its extension to the case where preference lists can include ties. This model was applied to randomly generated instances and also real-world instances arising from previous matching runs of the Scottish Foundation Allocation Scheme, used to allocate junior doctors to hospitals in Scotland.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑