期刊论文

Wang, Jianxin(jxwang@csu.edu.cn)

英文

Algorithms

1999-4893

2019

12

2

50

10.3390/a12020050

Conceptualization, M.L. and J.W.; methodology, M.L., J.W., Q.F. and B.F.; formal analysis, M.L. and B.F.; writing–original draft preparation, M.L. and B.F.; writing–review and editing, M.L., J.W. and Q.F.; project administration, J.W.; funding acquisition, J.W., Q.F. and B.F. This work was supported in part by the National Natural Science Foundation of China under Grants 61772179, 61672536, 61872450, 61420106009, and 61503128, in part by Hunan Provincial Natural Science Foundation of China under Grant 2019JJ40005, in part by the Scientific Research Fund of Hunan Provincial Education Department under Grant 17C0222, in part by Application-oriented Special Disciplines, Double First-Class University Project of Hunan Province(Xiangjiaotong [2018] 469), and in part by the Science and Technology Plan Project of Hunan Province under Grant 2016TP1020.

本校为其他机构

In order to increase the potential kidney transplants between patients and their incompatible donors, kidney exchange programs have been created in many countries. In the programs, designing algorithms for the kidney exchange problem plays a critical role. The graph theory model of the kidney exchange problem is to find a maximum weight packing of vertex-disjoint cycles and chains for a given weighted digraph. In general, the length of cycles is not more than a given constant L (typically 2 ≤ L ≤ 5), and the objective function corresponds to ...