A Constraint Programming Approach to the Hospitals / Residents Problem
From MaRDI portal
Publication:3612416
DOI10.1007/978-3-540-72397-4_12zbMath1214.90102OpenAlexW1882842148MaRDI QIDQ3612416
David F. Manlove, Gregg O'Malley, Chris Unsworth, Patrick Prosser
Publication date: 10 March 2009
Published in: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-72397-4_12
Combinatorial optimization (90C27) Theory of organizations, manpower planning in operations research (90B70) Matching models (91B68)
Related Items (8)
Stability Representations of Many-to-One Matching Problems: An Integer Optimization Approach ⋮ Matching formulation of the staff transfer problem: meta-heuristic approaches ⋮ Computing relaxations for the three-dimensional stable matching problem with cyclic preferences ⋮ ``Almost-stable matchings in the hospitals/residents problem with couples ⋮ Stable fractional matchings ⋮ Improving solution times for stable matching problems through preprocessing ⋮ Finding All Stable Pairs and Solutions to the Many-to-Many Stable Matching Problem ⋮ A collection of constraint programming models for the three-dimensional stable matching problem with cyclic preferences
This page was built for publication: A Constraint Programming Approach to the Hospitals / Residents Problem
