Mathematical programming formulations are developed for determining chains of organ-donation exchange pairs in a compatibility graph where pairwise exchanges may fail. The objective is to maximize the expected value where pairs are known to fail with given probabilities. In previous work, namely that of Dickerson et al. (Manag Sci 65(4):323–340, 2019) this NP-hard problem was solved heuristically or exactly only for limited path lengths. Although the problem appears highly nonlinear, we formulate it as a mixed-integer linear program. A computationally tractable layered formulation that approximately solves larger instances is also proposed and a computational study is presented for evaluating the proposed formulations.
Bibliographical notePublisher Copyright:
© 2021, The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature.
- Clearing algorithms
- Failure aware barter exchange
- Kidney exchange
- Layered formulation
- Longest path