Many kidney exchange programs (KEPs) use integer linear programming (ILP) based on a
hierarchical set of objectives to determine optimal sets of transplants. We propose innovative …

We examine some of the opportunities and challenges concerned with establishing a
centralized national kidney exchange program in Germany. Despite the many advantages of …

To overcome incompatibility issues, kidney patients may swap their donors. In international
kidney exchange programmes (IKEPs), countries merge their national patient–donor pools …

We introduce the half-cycle formulation (HCF), a new integer programming (IP) model for the
kidney exchange problem, which has life-saving applications. In HCF, a cycle (ie, set of …

This paper introduces a new learning-based approach for approximately solving the Kidney-
Exchange Problem (KEP), an NP-hard problem on graphs. The KEP consists of, given a …

Problem definition: Kidney paired donation programs allow patients registered with an
incompatible donor to receive a suitable kidney from another donor, as long as the latter's co …

Instance generation is crucial for linear programming algorithms, especially for the
evaluation and verification of corresponding methods. This study proposes a general …

This dissertation introduces the MCSPLIT family of algorithms for two closely-related NP-
hard problems that involve finding a large induced subgraph contained by each of two input …

A kidney exchange program, also called a kidney paired donation program, can be viewed
as a repeated, dynamic trading and allocation mechanism. This suggests that a dynamic …

Kidney exchange programs (KEPs) increase kidney transplantation by facilitating the
exchange of incompatible donors. Increasing the scale of KEPs leads to more opportunities …