Please use this identifier to cite or link to this item:
|Title:||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. © 2016 Elsevier B.V.|
|Appears in Collections:||CEGI - Articles in International Journals|
Files in This Item:
|202 kB||Adobe PDF||View/Open Request a copy|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.