Publication
Maximising expectation of the number of transplants in kidney exchange programmes
| dc.contributor.author | Klimentova, Xenia | |
| dc.contributor.author | Pedroso, João Pedro | |
| dc.contributor.author | Viana, Ana | |
| dc.date.accessioned | 2017-06-29T10:22:26Z | |
| dc.date.embargo | 2117 | |
| dc.date.issued | 2016 | |
| dc.description.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 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. | pt_PT |
| dc.description.version | info:eu-repo/semantics/publishedVersion | pt_PT |
| dc.identifier.doi | 10.1016/j.cor.2016.03.004 | pt_PT |
| dc.identifier.uri | http://hdl.handle.net/10400.22/9963 | |
| dc.language.iso | eng | pt_PT |
| dc.publisher | Elsevier | pt_PT |
| dc.relation.ispartofseries | Computers & Operations Research;Vol. 73 | |
| dc.relation.publisherversion | http://www.sciencedirect.com/science/article/pii/S0305054816300533 | pt_PT |
| dc.subject | Kidney exchange programmes | pt_PT |
| dc.subject | Cycle packing | pt_PT |
| dc.subject | Expectation optimisation | pt_PT |
| dc.title | Maximising expectation of the number of transplants in kidney exchange programmes | pt_PT |
| dc.type | journal article | |
| dspace.entity.type | Publication | |
| oaire.citation.title | Computers and Operations Research | pt_PT |
| rcaap.rights | closedAccess | pt_PT |
| rcaap.type | article | pt_PT |