A compact formulation for maximizing the expected number of transplants in kidney exchange programs

dc.contributor.author Alvelos,F en
dc.contributor.author Xenia Klimentova en
dc.contributor.author Rais,A en
dc.contributor.author Ana Viana en
dc.date.accessioned 2017-12-14T15:54:37Z
dc.date.available 2017-12-14T15:54:37Z
dc.date.issued 2015 en
dc.description.abstract Kidney exchange programs (KEPs) allow the exchange of kidneys between incompatible donor-recipient pairs. Optimization approaches can help KEPs in defining which transplants should be made among all incompatible pairs according to some objective. The most common objective is to maximize the number of transplants. In this paper, we propose an integer programming model which addresses the objective of maximizing the expected number of transplants, given that there are equal probabilities of failure associated with vertices and arcs. The model is compact, i.e. has a polynomial number of decision variables and constraints, and therefore can be solved directly by a general purpose integer programming solver (e.g. Cplex). en
dc.identifier.uri http://repositorio.inesctec.pt/handle/123456789/4108
dc.identifier.uri http://dx.doi.org/10.1088/1742-6596/616/1/012011 en
dc.language eng en
dc.relation 5577 en
dc.relation 3708 en
dc.rights info:eu-repo/semantics/embargoedAccess en
dc.title A compact formulation for maximizing the expected number of transplants in kidney exchange programs en
dc.type conferenceObject en
dc.type Publication en
Files
Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
P-00G-DZW.pdf
Size:
216.47 KB
Format:
Adobe Portable Document Format
Description: