Please use this identifier to cite or link to this item:
|Title:||Maximising expectation of the number of transplants in kidney exchange programmes|
João Pedro Pedroso
|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.|
|Appears in Collections:||CEGI - Articles in International Journals|
Files in This Item:
|436.88 kB||Adobe PDF||View/Open Request a copy|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.