A compact formulation for maximizing the expected number of transplants in kidney exchange programs
A compact formulation for maximizing the expected number of transplants in kidney exchange programs
复制标题
紧凑的配方，可最大限度地提高肾脏交换计划中的预期移植数量
DOI：
10.1088/1742-6596/616/1/012011
复制
发表时间：
2015
期刊：
影响因子：
--
通讯作者：
Ana Viana
中科院分区：
文献类型：
--
作者：
F. Alvelos;Xenia Klimentova;A. Rais;Ana Viana
肾脏交换计划(KEP)允许不相容的供受者对之间交换肾脏。优化方法可以帮助Kep根据某个目标确定在所有不相容的配对中应该进行哪些移植。最常见的目标是最大限度地增加移植数量。在本文中，我们提出了一个整数规划模型，它的目标是最大化预期的移植数量，假设与顶点和弧线相关的失败概率相等。该模型是紧凑的，即具有多项式数量的决策变量和约束，因此可以直接用通用整数规划求解器(如Cplex)求解。
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).