Kidney exchange is an increasing modality for transplanting end stage renal disease patients with an incompatible living donor. Typically, the aim is to find an allocation of donors to patients that is optimal with respect to multiple hierarchical criteria. This paper presents an iterative branch-and-price algorithm for clearing such multi-criteria kidney exchanges with large patient-donor pools. Using a polynomial pricing procedure, the algorithm accomodates not only for cycles of incompatible pairs but also for long chains initiated by unspecified donors. Such chains are increasingly common and important in clinical practice, but, as we show, cannot be efficiently dealt with using existing depth-first pricing procedures. Our algorithm also supports individual rationality constraints required for multi-center coordination. Using Dutch kidney exchange data, we show the effect of long term multi-criteria optimization with our algorithm.

branch-and-price algorithm, donor patients, kidney transplantation
Erasmus School of Economics
hdl.handle.net/1765/38649
Econometric Institute Research Papers
Report / Econometric Institute, Erasmus University Rotterdam
Erasmus School of Economics

Glorie, K.M, Wagelmans, A.P.M, & van de Klundert, J.J. (2012). Iterative branch-and-price for hierarchical multi-criteria kidney exchange (No. EI 2012-11). Report / Econometric Institute, Erasmus University Rotterdam (pp. 1–24). Erasmus School of Economics. Retrieved from http://hdl.handle.net/1765/38649