An Integer Programming Model for the Hospitals/Residents Problem with Couples
The Hospitals/Residents problem with Couples (hrc) is a generalisation of the classical Hospitals/Residents 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. Further, we describe an empirical study of an IP model for 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.
Iain McBride: Supported by a SICSA Prize PhD Studentship. David F. Manlove: Supported by Engineering and Physical Sciences Research Council grant GR/EP/ K010042/1.
- 2.Biró, P., Irving, R. W., & Schlotter, I. (2011). Stable matching with couples: An empirical study. ACM Journal of Experimental Algorithmics, 16, Section 1, article 2, 27 p.Google Scholar
- 3.Gusfield, D., & Irving, R. W. (1989). The stable marriage problem: Structure and algorithms. Cambridge: MIT Press.Google Scholar
- 4.McBride, I., & Manlove, D. F. (2013). The hospitals/residents problem with couples: Complexity and integer programming models. Technical Report, Computing Research Repository, Cornell University Library.Google Scholar