The parallel processor scheduling and bin packing problems with contiguity constraints are
important in the field of combinatorial optimization because both problems can be used as …

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 …

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 …

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 …

Kidney transplantation can occur in two different settings: the organ to be transplanted can
be removed either from a deceased donor or from a living donor. When a patient has the …

There is no conflict between maximizing the number of transplants and giving priority to, eg,
highly HLA-sensitized recipients in kidney exchange programs that only permit pairwise …

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 …

In this paper we present simulations for international kidney exchange programmes (KEPs).
KEPs are organised in more than ten countries in Europe to facilitate the exchanges of …

Two events, with major implications for US voters, occur after each decennial census. First,
congressional “apportionment” takes place, followed by congressional “districting.” …