Anderson, RossAshlagi, ItaiGamarnik, DavidRoth, Alvin2017-03-202015Anderson, Ross, Itai Ashlagi, David Gamarnik, and Alvin E. Roth. 2015. “Finding Long Chains in Kidney Exchange Using the Traveling Salesman Problem.” Proceedings of the National Academy of Sciences 112 (3) (January 5): 663–668. doi:10.1073/pnas.1421853112.0027-8424http://nrs.harvard.edu/urn-3:HUL.InstRepos:30830063There are currently more than 100,000 patients on the waiting list in the United States for a kidney transplant from a deceased donor. To address this shortage, kidney exchange programs allow patients with living incompatible donors to exchange donors through cycles and chains initiated by altruistic nondirected donors. To determine which exchanges will take place, kidney exchange programs use algorithms for maximizing the number of transplants under constraints about the size of feasible exchanges. This problem is NP-hard, and algorithms previously used were unable to optimize when chains could be long. We developed two algorithms that use integer programming to solve this problem, one of which is inspired by the traveling salesman, that together can find optimal solutions in practice.en-USkidney exchangekidney paired donationtransplantationalgorithmscomputationJournal Article2017-02-0820152017-03-2010.1073/pnas.1421853112