Maximizing expected number of transplants in kidney exchange programs

Abstract In this paper we address the problem of maximizing the expected number of transplants in a kidney exchange program. We propose an integer programming model with an exponential number of decision variables which are associated with cycles. By introducing the concept of type of cycle , we avoid the complete cycle enumeration and develop a branch-and-price approach.