Journal
COMPUTERS & OPERATIONS RESEARCH
Volume 73, Issue -, Pages 1-11Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2016.03.004
Keywords
Kidney exchange programmes; Cycle packing; Expectation optimisation
Categories
Funding
- Fundacao para a Ciencia e a Tecnologia (FCT) [PTDC/IIMGES/2830/2014, SFRH/BPD/101134/2014]
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available