TY - JOUR
T1 - Integer programming approach and application of reformulation-linearization technique to liver exchange problem
AU - Yuh, Junsang
AU - Eun, Joonyup
AU - Cheong, Taesu
N1 - Funding Information:
This research was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Korean government (Ministry of Science, ICT & Future Planning) (No. NRF-2015R1C1A1A02036682 ) and the Ministry of Education (No. NRF-2018R1D1A1B07047651 ) and also supported by Korea Institute for Advancement of Technology (KIAT) grant funded by the Korea government (MOTIE) ( P0008691 , The Competency Development Program for Industry Specialist).
Publisher Copyright:
© 2021
PY - 2021/12/15
Y1 - 2021/12/15
N2 - Organ transplants are essential for many end-stage organic disease patients. Unfortunately, because of medical or biological incompatibilities, not all donors can donate to their intended recipients. These incompatibilities can be overcome by organ exchange programs, which find new compatible donor–patient pairs by exchanging donors between patients. Organ exchange programs have become prevalent in the last decade for kidneys, and liver exchanges have also been increasing steadily. However, despite the growing number of liver exchanges, since the procedure is relatively new, there is a lack of studies attempting to optimize exchange plans through mathematical programming. This paper develops a new integer programming model for liver exchange programs that takes into account the unique characteristics of liver transplantation. In addition, a new enhanced model is obtained by applying the reformulation-linearization technique (RLT), which provides tight linear programming (LP) relaxation bounds and is computationally efficient.
AB - Organ transplants are essential for many end-stage organic disease patients. Unfortunately, because of medical or biological incompatibilities, not all donors can donate to their intended recipients. These incompatibilities can be overcome by organ exchange programs, which find new compatible donor–patient pairs by exchanging donors between patients. Organ exchange programs have become prevalent in the last decade for kidneys, and liver exchanges have also been increasing steadily. However, despite the growing number of liver exchanges, since the procedure is relatively new, there is a lack of studies attempting to optimize exchange plans through mathematical programming. This paper develops a new integer programming model for liver exchange programs that takes into account the unique characteristics of liver transplantation. In addition, a new enhanced model is obtained by applying the reformulation-linearization technique (RLT), which provides tight linear programming (LP) relaxation bounds and is computationally efficient.
KW - Integer programming
KW - Liver exchange program
KW - OR in health services
KW - Reformulation-linearization technique
UR - http://www.scopus.com/inward/record.url?scp=85111476708&partnerID=8YFLogxK
U2 - 10.1016/j.eswa.2021.115599
DO - 10.1016/j.eswa.2021.115599
M3 - Article
AN - SCOPUS:85111476708
VL - 185
JO - Expert Systems with Applications
JF - Expert Systems with Applications
SN - 0957-4174
M1 - 115599
ER -