Reformulation-linearization technique approach for kidney exchange program IT healthcare platforms

Junsang Yuh, Seokhyun Chung, Tae Su Cheong

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

Kidney exchange allows a potential living donor whose kidney is incompatible with his intended recipient to donate a kidney to another patient so that the donor's intended recipient can receive a compatible kidney from another donor. These exchanges can include cycles of longer than two donor-patient pairs and chains produced by altruistic donors. Kidney exchange programs (KEPs) can be modeled as a maximum-weight cycle-packing problem in a directed graph. This paper develops a new integer programming model for KEPs by applying the reformulation-linearization technique (RLT) to enhance a lower bound obtained by its linear programming (LP) relaxation. Given the results obtained from the proposed model, the model is expected to be utilized in the integrated KEP IT (Information Technology) healthcare platform to obtain plans for optimized kidney exchanges.

Original languageEnglish
Article number847
JournalApplied Sciences (Switzerland)
Volume7
Issue number8
DOIs
Publication statusPublished - 2017 Aug 17

Fingerprint

kidneys
linearization
Linearization
Information technology
platforms
Directed graphs
Integer programming
Linear programming
linear programming
cycles
programming
integers

Keywords

  • Integer programming
  • IT healthcare platform
  • Kidney exchange program
  • Reformulation-linearization technique

ASJC Scopus subject areas

  • Materials Science(all)
  • Instrumentation
  • Engineering(all)
  • Process Chemistry and Technology
  • Computer Science Applications
  • Fluid Flow and Transfer Processes

Cite this

Reformulation-linearization technique approach for kidney exchange program IT healthcare platforms. / Yuh, Junsang; Chung, Seokhyun; Cheong, Tae Su.

In: Applied Sciences (Switzerland), Vol. 7, No. 8, 847, 17.08.2017.

Research output: Contribution to journalArticle

@article{22e9d3f312fb47e7957961397b5d3cd4,
title = "Reformulation-linearization technique approach for kidney exchange program IT healthcare platforms",
abstract = "Kidney exchange allows a potential living donor whose kidney is incompatible with his intended recipient to donate a kidney to another patient so that the donor's intended recipient can receive a compatible kidney from another donor. These exchanges can include cycles of longer than two donor-patient pairs and chains produced by altruistic donors. Kidney exchange programs (KEPs) can be modeled as a maximum-weight cycle-packing problem in a directed graph. This paper develops a new integer programming model for KEPs by applying the reformulation-linearization technique (RLT) to enhance a lower bound obtained by its linear programming (LP) relaxation. Given the results obtained from the proposed model, the model is expected to be utilized in the integrated KEP IT (Information Technology) healthcare platform to obtain plans for optimized kidney exchanges.",
keywords = "Integer programming, IT healthcare platform, Kidney exchange program, Reformulation-linearization technique",
author = "Junsang Yuh and Seokhyun Chung and Cheong, {Tae Su}",
year = "2017",
month = "8",
day = "17",
doi = "10.3390/app7080847",
language = "English",
volume = "7",
journal = "Applied Sciences (Switzerland)",
issn = "2076-3417",
publisher = "Multidisciplinary Digital Publishing Institute",
number = "8",

}

TY - JOUR

T1 - Reformulation-linearization technique approach for kidney exchange program IT healthcare platforms

AU - Yuh, Junsang

AU - Chung, Seokhyun

AU - Cheong, Tae Su

PY - 2017/8/17

Y1 - 2017/8/17

N2 - Kidney exchange allows a potential living donor whose kidney is incompatible with his intended recipient to donate a kidney to another patient so that the donor's intended recipient can receive a compatible kidney from another donor. These exchanges can include cycles of longer than two donor-patient pairs and chains produced by altruistic donors. Kidney exchange programs (KEPs) can be modeled as a maximum-weight cycle-packing problem in a directed graph. This paper develops a new integer programming model for KEPs by applying the reformulation-linearization technique (RLT) to enhance a lower bound obtained by its linear programming (LP) relaxation. Given the results obtained from the proposed model, the model is expected to be utilized in the integrated KEP IT (Information Technology) healthcare platform to obtain plans for optimized kidney exchanges.

AB - Kidney exchange allows a potential living donor whose kidney is incompatible with his intended recipient to donate a kidney to another patient so that the donor's intended recipient can receive a compatible kidney from another donor. These exchanges can include cycles of longer than two donor-patient pairs and chains produced by altruistic donors. Kidney exchange programs (KEPs) can be modeled as a maximum-weight cycle-packing problem in a directed graph. This paper develops a new integer programming model for KEPs by applying the reformulation-linearization technique (RLT) to enhance a lower bound obtained by its linear programming (LP) relaxation. Given the results obtained from the proposed model, the model is expected to be utilized in the integrated KEP IT (Information Technology) healthcare platform to obtain plans for optimized kidney exchanges.

KW - Integer programming

KW - IT healthcare platform

KW - Kidney exchange program

KW - Reformulation-linearization technique

UR - http://www.scopus.com/inward/record.url?scp=85027690689&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85027690689&partnerID=8YFLogxK

U2 - 10.3390/app7080847

DO - 10.3390/app7080847

M3 - Article

AN - SCOPUS:85027690689

VL - 7

JO - Applied Sciences (Switzerland)

JF - Applied Sciences (Switzerland)

SN - 2076-3417

IS - 8

M1 - 847

ER -