A carregar...
Publicação
Maximising expectation of the number of transplants in kidney exchange programmes
| Nome: | Descrição: | Tamanho: | Formato: | |
|---|---|---|---|---|
| 578.14 KB | Adobe PDF |
Orientador(es)
Resumo(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.
Descrição
Palavras-chave
Kidney exchange programmes Cycle packing Expectation optimisation
Contexto Educativo
Citação
Editora
Elsevier