1 citations · 1 across the 4 of their papers we have counts for
5 papers
Couples can be tractable: New algorithms and hardness results for the Hospitals / Residents problem with Couples
Gergely Csáji, David Manlove, Iain McBride +1
In this paper, we study the Hospitals / Residents problem with Couples (HRC), where a solution is a stable matching or a report that none exists. We present a novel polynomial-time…
"Almost-stable" matchings in the Hospitals / Residents problem with Couples
David F. Manlove, Iain McBride, James Trimble
The Hospitals / Residents problem with Couples (HRC) models the allocation of intending junior doctors to hospitals where couples are allowed to submit joint preference lists over…
Stable matchings of teachers to schools
Katarina Cechlarova, Tamas Fleiner, David F. Manlove +1
Several countries successfully use centralized matching schemes for school or higher education assignment, or for entry-level labour markets. In this paper we explore the computati…
Integer programming methods for special college admissions problems
Peter Biro, Iain McBride
We develop Integer Programming (IP) solutions for some special college admission problems arising from the Hungarian higher education admission scheme. We focus on four special fea…
The Hospitals / Residents Problem with Couples: Complexity and Integer Programming Models
P. Biro, D. F. Manlove, I. McBride
The Hospitals / Residents problem with Couples (HRC) is a generalisation of the classical Hospitals / Resident problem (HR) that is important in practical applications because it m…