Klimentova, XeniaPedroso, João PedroViana, Ana2017-06-292016http://hdl.handle.net/10400.22/9963This 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.engKidney exchange programmesCycle packingExpectation optimisationjournal article10.1016/j.cor.2016.03.004