Kidney exchange programmes increase the rate of living donor kidney transplants, and
operations research techniques are vital to such programmes. These techniques, as well as …

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 …

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 …

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 …

The Kidney Exchange Problem (KEP) determines organ exchange chains and cycles
amongst a pool of patient-donor pairs (PDP) and non-directed donors (NDD) allowing for the …

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 …

Modern satellite communication systems are designed to serve dispersed users with
changing operational requirements. Allocating resources to meet these requirements …

We introduce the following cycle selection problem which is motivated by an application to
kidney exchange problems. Given a directed graph G=(V, A), a cycle selection is a subset of …

Kidney paired donation programs (KPDPs) match patients with willing but incompatible
donors to compatible donors with an assurance that when they donate, their intended …