Zobrazeno 1 - 10
of 29
pro vyhledávání: '"McBride, Iain"'
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 algorithm that can find a near-feasible stable matching (adjusting th
Externí odkaz:
http://arxiv.org/abs/2311.00405
Autor:
McBride, Iain
The classical Hospitals / Residents problem (HR) is a many-to-one bipartite matching problem involving preferences, motivated by centralised matching schemes arising in entry level labour markets, the assignment of pupils to schools and higher educat
Externí odkaz:
http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.679557
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 pairs of (typically geographically close) hospitals. It is known that
Externí odkaz:
http://arxiv.org/abs/1602.01956
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 computational aspects of a possible similar scheme for assigning teachers to sc
Externí odkaz:
http://arxiv.org/abs/1501.05547
Autor:
Biro, Peter, McBride, Iain
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 features, namely the solution concept of stable score-limits, the presenc
Externí odkaz:
http://arxiv.org/abs/1408.6878
Autor:
PARDY, MARION, MORRIS, BARRY, STEWART, DONNA, POND, ROB, LEGROW, SHELDON, MCBRIDE, IAIN, ANGUS, MURRAY, MIDDLEBRO, TANYA, SAVEALL, VERNA, KELLS, JIM, DRYDEN, FREEMAN A., BYERS, PAM, UNTERMANN, GABRIELLE, WITMER, JACK
Publikováno v:
Broadview; Jun2024, Vol. 6 Issue 3, p5-6, 2p, 1 Color Photograph
Autor:
GODIN, ROSEMARY, REMMEL, RAI, MACQUARRIE, GAY, DAVIS, MELANIE, HUNTER, DON, GARLOUGH, GORDON, HENDERSON-FERGUSON, PAULINE, GAUTHIER, LIZ, STAINTON, STAN B., BAKER, INEZ, SCHOOLEY, HUGH O., MCBRIDE, IAIN, EICKHOFF, RUTH
Publikováno v:
Broadview; Dec2023, Vol. 5 Issue 7, p5-6, 2p, 1 Color Photograph
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 features, namely the solution concept of stable score-limits, the presenc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______1687::4f0161907698338b100f6f28936c87a5
https://hdl.handle.net/10419/190456
https://hdl.handle.net/10419/190456
Several countries successfully use centralized matching schemes for assigning students to study places or fresh graduates to their first positions. In this paper we explore the computational aspects of a possible similar scheme for assigning trainee
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=core_ac_uk__::f5d631a90f62c28b5d988dd3021d955b
https://eprints.gla.ac.uk/98988/1/98988.pdf
https://eprints.gla.ac.uk/98988/1/98988.pdf
Autor:
McBride, Iain
Publikováno v:
IndraStra Global.
The classical Hospitals / Residents problem (HR) is a many-to-one bipartite matching problem involving preferences, motivated by centralised matching schemes arising in entry level labour markets, the assignment of pupils to schools and higher educat