Maximising expectation of the number of transplants in kidney exchange programmes
Maximising expectation of the number of transplants in kidney exchange programmes
复制标题
DOI：
10.1016/j.cor.2016.03.004
复制
发表时间：
2016-09-01
影响因子：
4.6
通讯作者：
Viana, Ana
中科院分区：
文献类型：
--
作者：
Klimentova, Xenia;Pedroso, Joao Pedro;Viana, Ana
本文讨论了在肾脏交换计划中最大化预期移植数量的问题。提出了失败情况下匹配重排的新方案，以及用于计算最优期望值的新的树搜索算法。大量的计算实验证明了该算法的有效性，并显示了一种新提出的方案--子集-资源方案与已有方法相比具有明显的优越性。(C)2016爱思唯尔有限公司。保留所有权利。
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. (C) 2016 Elsevier Ltd. All rights reserved.