An Approximation Algorithm for Solving the Heterogeneous Chinese Postman Problem. - Jianping Li 007; Lijian Cai; Junran Lichen; Pengxiang Pan; Wencheng Wang 003; Suding Liu (AAIM, 2021)

Bin packing with divisible item sizes and rejection penalties. - Jianping Li 007; Pengxiang Pan; Lijian Cai; Junran Lichen; Wencheng Wang 003 (Optim. Lett., 2022)

Approximation algorithms for solving the heterogeneous Chinese postman problem. - Jianping Li 007; Pengxiang Pan; Junran Lichen; Lijian Cai; Wencheng Wang 003; Suding Liu (J. Comb. Optim., 2023)

Delay-constrained minimum shortest path trees and related problems. - Junran Lichen; Lijian Cai; Jianping Li 007; Suding Liu; Pengxiang Pan; Wencheng Wang 003 (Theor. Comput. Sci., 2023)

Combinatorial algorithms for solving the constrained knapsack problems with divisible item sizes and penalties. - Jianping Li 007; Lijian Cai; Junran Lichen; Pengxiang Pan (Optim. Lett., 2023)

Algorithms for the Constrained Assignment Problems with Bounds and Maximum Penalty. - Guojun Hu; Pengxiang Pan; Junran Lichen; Lijian Cai (AAIM (2), 2024)