An Integer Programming Model for the Hospitals/Residents Problem with Couples

McBride, I. and Manlove, D. (2013) An Integer Programming Model for the Hospitals/Residents Problem with Couples. [Data Collection]

Enlighten Publications URI: http://eprints.gla.ac.uk/id/eprint/98265

Collection description

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.

College / School: College of Science and Engineering > School of Computing Science
Date Deposited: 20 Jan 2016 16:20
Enlighten Publications URL: http://eprints.gla.ac.uk/98265/
Retention date: 3 September 2023
Funder's Name: Engineering & Physical Sciences Research Council (EPSRC)
URI: http://researchdata.gla.ac.uk/id/eprint/255

Available Files

Data

Read me

Repository Staff Only: Update this record

McBride, I. and Manlove, D. (2013); An Integer Programming Model for the Hospitals/Residents Problem with Couples

University of Glasgow

10.5525/gla.researchdata.255

Retrieved: 2017-11-20

Downloads

Downloads per month over past year