Novel integer programming models for the stable kidney exchange problem
From MaRDI portal
Publication:6167384
DOI10.1016/j.ejor.2022.09.031arXiv2012.04918MaRDI QIDQ6167384
João Pedro Pedroso, Xenia Klimentova, Virginia Costa, Péter Biró, Ana Viana
Publication date: 10 July 2023
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2012.04918
integer programming; OR in health services; stable exchange; kidney exchange programs; \(k\)-way exchange
90Bxx: Operations research and management science
Cites Work
- Integer programming methods for special college admissions problems
- On the kidney exchange problem: cardinality constrained cycle and chain problems on directed graphs: a survey of integer programming approaches
- Age-based preferences in paired kidney exchange
- Pairwise kidney exchange
- Weak versus strong domination in a market with indivisible goods
- Mathematical models for stable matching problems with ties and incomplete lists
- On cores and indivisibility
- Three-sided stable matchings with cyclic preferences
- Circular stable matching and 3-way kidney transplant
- College admissions with ties and common quotas: integer programming approach
- New insights on integer-programming models for the kidney exchange problem
- Kidney Exchange
- Three-Dimensional Stabl Matching Problems
- An efficient algorithm for the “stable roommates” problem
- Algorithmics of Matching Under Preferences
- College Admissions and the Stability of Marriage
- Hardness results for stable exchange problems
