Manlove, D. F. , O'Malley, G., Prosser, P. and Unsworth, C. (2005) A Constraint Programming Approach to the Hospitals / Residents Problem. In: Fourth Workshop on Modelling and Reformulating Constraint Satisfaction Problems, Sitges, Spain, 01-05 Oct 2005, pp. 28-43.
|
Text
150588.pdf - Accepted Version 409kB |
Abstract
An instance I of the Hospitals / Residents problem (HR) involves a set of residents (graduating medical students) and a set of hospitals, where each hospital has a given capacity. The residents have preferences for the hospitals, as do hospitals for residents. A solution of I is a stable matching, which is an assignment of residents to hospitals that respects the capacity conditions and preference lists in a precise way. In this paper we present constraint encodings for HR that give rise to important structural properties. We also present a computational study using both randomly-generated and real-world instances. Our study suggests that Constraint Programming is indeed an applicable technology for solving this problem, in terms of both theory and practice.
| Item Type: | Conference Proceedings |
|---|---|
| Status: | Published |
| Refereed: | Yes |
| Glasgow Author(s) Enlighten ID: | Manlove, Professor David and Unsworth, Dr Chris and Prosser, Dr Patrick and O'Malley, Dr Gregg |
| Authors: | Manlove, D. F., O'Malley, G., Prosser, P., and Unsworth, C. |
| College/School: | College of Science and Engineering > School of Computing Science |
| Copyright Holders: | Copyright © 2005 The Authors |
| First Published: | First published in Proceedings of the Fourth Workshop on Modelling and Reformulating Constraint Satisfaction Problems: 28-43 |
| Publisher Policy: | Reproduced with the permission of the Authors |
University Staff: Request a correction | Enlighten Editors: Update this record
Funder and Project Information
Funder and Project Information