The Hospitals/Residents Problem with Couples: complexity and integer programming models

Biró, P., Manlove, D. F. and McBride, I. (2014) The Hospitals/Residents Problem with Couples: complexity and integer programming models. Lecture Notes in Computer Science, 8504, pp. 10-21. (doi:10.1007/978-3-319-07959-2_2)

[img]
Preview
Text
97774.pdf - Accepted Version

383kB

Publisher's URL: http://dx.doi.org/10.1007/978-3-319-07959-2_2

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.

Item Type:Articles
Status:Published
Refereed:Yes
Glasgow Author(s) Enlighten ID:McBride, Dr Ian and Manlove, Professor David
Authors: Biró, P., Manlove, D. F., and McBride, I.
College/School:College of Science and Engineering > School of Computing Science
Journal Name:Lecture Notes in Computer Science
Publisher:Springer
ISSN:0302-9743
Copyright Holders:Copyright © 2014 Springer
First Published:First published in Lecture Notes in Computer Science 8504:10-21
Publisher Policy:Reproduced in accordance with the copyright policy of the publisher.
Related URLs:
Data DOI:10.5525/gla.researchdata.254

University Staff: Request a correction | Enlighten Editors: Update this record