期刊
COMPUTERS & OPERATIONS RESEARCH
卷 73, 期 -, 页码 1-11出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2016.03.004
关键词
Kidney exchange programmes; Cycle packing; Expectation optimisation
类别
资金
- Fundacao para a Ciencia e a Tecnologia (FCT) [PTDC/IIMGES/2830/2014, SFRH/BPD/101134/2014]
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据