Repository logo
 
Loading...
Thumbnail Image
Publication

Maximising expectation of the number of transplants in kidney exchange programmes

Use this identifier to reference this record.
Name:Description:Size:Format: 
ART_AnaViana_DEE_2016.pdf578.14 KBAdobe PDF Download

Advisor(s)

Abstract(s)

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 computa-tional 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.

Description

Keywords

Kidney exchange programmes Cycle packing Expectation optimisation

Citation

Research Projects

Organizational Units

Journal Issue

Publisher

Elsevier

CC License

Altmetrics