We consider a real-world three-dimensional container loading problem in which the
objective is to maximize the volume of the items packed into a single vehicle. While …

When each patient of a kidney exchange program has a preference ranking over its set of
compatible donors, questions naturally arise surrounding the stability of the proposed …

Renal patients who have a willing but incompatible donor can decide to participate in a
kidney exchange program (KEP). The goal of a KEP is to identify sets of incompatible pairs …

This introduction aims to present the core chapters of the dissertation and their common
topic: kidney transplantation. For a better understanding of the thesis, the last section of the …

Chronisches Nierenversagen hat sich zu einer der häufigsten natürlichen Todesursachen in
unserer Gesellschaft entwickelt. Eine Möglichkeit der Behandlung ist die Transplantation …

Abstract In this Bachelor Final Project a literature overview on the Kidney Exchange Problem
(KEP) is presented. Specifically, existing Integer Programming formulations for the KEP have …

The kidney exchange problem with reserve arcs (KEP-RA) is an extension of the classical
kidney exchange problem in which one is allowed to select in the solution a limited number …

We study a Kidney Exchange Problem (KEP) with altruistic donors and incompatible patient-
donor pairs. Kidney exchanges can be modelled in a directed graph as circuits or as paths …

Kidney transplants are life-saving surgeries that require a person to donate their kidney to
the patient. However, the donor's kidney is often not compatible with that of the patient. For …

This thesis presents a novel integer programming model for the kidney exchange problem
(KEP) called the third-cycle formulation (TCF). In this model, a cycle is represented by three …