IDEAS home Printed from https://ideas.repec.org/h/spr/oprchp/978-3-319-07001-8_40.html
   My bibliography  Save this book chapter

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

In: Operations Research Proceedings 2013

Author

Listed:
  • Iain McBride

    (University of Glasgow)

  • David F. Manlove

    (University of Glasgow)

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. 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.

Suggested Citation

  • Iain McBride & David F. Manlove, 2014. "An Integer Programming Model for the Hospitals/Residents Problem with Couples," Operations Research Proceedings, in: Dennis Huisman & Ilse Louwerse & Albert P.M. Wagelmans (ed.), Operations Research Proceedings 2013, edition 127, pages 293-299, Springer.
    • Handle: RePEc:spr:oprchp:978-3-319-07001-8_40
    DOI: 10.1007/978-3-319-07001-8_40
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:oprchp:978-3-319-07001-8_40. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.