The hospitals / residents problem with couples: complexity and integer programming models

Abstract

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, and also an inapproximability bound for finding a matching with the minimum number of blocking pairs in equally restricted instances of hrc. Further, we present a full description of the first Integer Programming model for finding a maximum cardinality stable matching in an instance of hrc and we describe empirical results when this model applied to randomly generated instances of hrc. © 2014 Springer International Publishing.