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

Mini EURO Conference on Improving Healthcare: new challenges, new approaches

物理学;医药卫生

Alvelos, Filipe^1 ; Klimentova, Xenia^2 ; Rais, Abdur^4 ; Viana, Ana^2,3

Centro Algoritmi, Departamento de Produção e Sistemas, Universidade Do Minho, Braga

4710-057, Portugal^1

INESC TEC, Campus da FEUP, Porto

4200-465, Portugal^2

ISEP - School of Engineering, Polytechnic of Porto, Porto

4200-072, Portugal^3

Centro Algoritmi Universidade Do Minho, Braga

4710-057, Portugal^4

关键词: Compact formulations;    Decision variables;    Equal probability;    Integer programming models;    Kidney exchanges;    Optimization approach;    Polynomial number;   

Others  :  https://iopscience.iop.org/article/10.1088/1742-6596/616/1/012011/pdf
DOI  :  10.1088/1742-6596/616/1/012011

学科分类：卫生学

来源: IOP

【 摘 要 】

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).