Documents disponibles écrits par cet auteur

Maximizing the efficiency of the U.S. liver allocation system through region design / Nan Kong in Management science, Vol. 56 N° 12 (Décembre 2010) 

Public ISBD [article]  in Management science > Vol. 56 N° 12 (Décembre 2010) . - pp. 2111-2122 Titre : Maximizing the efficiency of the U.S. liver allocation system through region design Type de document : texte imprimé Auteurs : Nan Kong, Auteur ; Andrew J. Schaefer, Auteur ; Brady Hunsaker, Auteur Année de publication : 2011 Article en page(s) : pp. 2111-2122 Note générale : Management Langues : Anglais (eng) Mots-clés : Set  partitioning  Branch  and  price  Column  generation  Clustering  Organ  allocation Index. décimale : 658 Organisation des entreprises. Techniques du commerce Résumé : Cadaveric liver transplantation is the only viable therapy for end-stage liver disease patients without a living donor. However, this type of transplantation is hindered in the United States by donor scarcity and rapid viability decay. Given these difficulties, the current U.S. liver allocation policy balances allocation likelihood and geographic proximity by allocating cadaveric livers hierarchically. We consider the problem of maximizing the efficiency of intraregional transplants through the redesign of liver allocation regions. We formulate the problem as a set partitioning problem that clusters organ procurement organizations into regions. We develop an estimate of viability-adjusted intraregional transplants to capture the trade-off between large and small regions. We utilize branch and price because the set partitioning formulation includes too many potential regions to handle explicitly. We formulate the pricing problem as a mixed-integer program and design a geographic-decomposition heuristic to generate promising columns quickly. Because the optimal solution depends on the design of geographic decomposition, we develop an iterative procedure that integrates branch and price with local search to alleviate this dependency. Finally, we present computational studies that show the benefit of region redesign and the efficacy of our solution approach. Our carefully calibrated test instances can be solved within a reasonable amount of time, and the resulting region designs yield a noticeable improvement over the current configuration. DEWEY : 658 ISSN : 0025-1909 En ligne : http://mansci.journal.informs.org/cgi/content/abstract/56/12/2111 [article] Maximizing the efficiency of the U.S. liver allocation system through region design [texte imprimé] / Nan Kong, Auteur ; Andrew J. Schaefer, Auteur ; Brady Hunsaker, Auteur . - 2011 . - pp. 2111-2122. Management Langues : Anglais (eng) in Management science > Vol. 56 N° 12 (Décembre 2010) . - pp. 2111-2122 Mots-clés : Set  partitioning  Branch  and  price  Column  generation  Clustering  Organ  allocation Index. décimale : 658 Organisation des entreprises. Techniques du commerce Résumé : Cadaveric liver transplantation is the only viable therapy for end-stage liver disease patients without a living donor. However, this type of transplantation is hindered in the United States by donor scarcity and rapid viability decay. Given these difficulties, the current U.S. liver allocation policy balances allocation likelihood and geographic proximity by allocating cadaveric livers hierarchically. We consider the problem of maximizing the efficiency of intraregional transplants through the redesign of liver allocation regions. We formulate the problem as a set partitioning problem that clusters organ procurement organizations into regions. We develop an estimate of viability-adjusted intraregional transplants to capture the trade-off between large and small regions. We utilize branch and price because the set partitioning formulation includes too many potential regions to handle explicitly. We formulate the pricing problem as a mixed-integer program and design a geographic-decomposition heuristic to generate promising columns quickly. Because the optimal solution depends on the design of geographic decomposition, we develop an iterative procedure that integrates branch and price with local search to alleviate this dependency. Finally, we present computational studies that show the benefit of region redesign and the efficacy of our solution approach. Our carefully calibrated test instances can be solved within a reasonable amount of time, and the resulting region designs yield a noticeable improvement over the current configuration. DEWEY : 658 ISSN : 0025-1909 En ligne : http://mansci.journal.informs.org/cgi/content/abstract/56/12/2111