Maximising expectation of the number of transplants in kidney exchange programmes |
| |
| Affiliation: | 1. Department of Statistics and Operations Research, University of Graz, Austria;2. Dipartimento di Ingegneria, Università degli Studi Roma Tre, Italy;3. Dipartimento di Ingegneria Civile e Ingegneria Informatica, Università degli Studi di Roma “Tor Vergata”, Italy;4. Department of Statistics and Operations Research, University of Graz, Austria;1. EDF R&D Osiris, EDF LAB Boulevard Gaspard Monge, Palaiseau 91120, France;2. INRIA team RealOpt, A33, 351 Cours de la Libération, Talence 33400, France;1. University of Amsterdam, Korteweg-de Vries Institute for Mathematics and Amsterdam Business School, The Netherlands;2. Centrum Wiskunde & Informatica, Science Park 123, 1098 XG Amsterdam, The Netherlands |
| |
| Abstract: | This paper addresses the problem of maximising the expected number of transplants in kidney exchange programmes. New schemes for matching rearrangement in case of failure are presented, along with a new tree search algorithm used for the computation of optimal expected values. Extensive computational experiments demonstrate the effectiveness of the algorithm and reveal a clear superiority of a newly proposed scheme, subset-recourse, as compared to previously known approaches. |
| |
| Keywords: | Kidney exchange programmes Cycle packing Expectation optimisation |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
