Approximation algorithms for solving the 1-line Euclidean minimum Steiner tree problem. - Jianping Li 007; Suding Liu; Junran Lichen; Wencheng Wang 003; Yujie Zheng (J. Comb. Optim., 2020)

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)

Approximation algorithms for solving the line-capacitated minimum Steiner tree problem. - Jianping Li 007; Wencheng Wang 003; Junran Lichen; Suding Liu; Pengxiang Pan (J. Glob. Optim., 2022)

An Exact Algorithm for the Line-Constrained Bottleneck k-Steiner Tree Problem. - Jianping Li 007; Suding Liu; Junran Lichen (COCOA (1), 2023)

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)

Approximation algorithm for solving the 1-line Steiner tree problem with minimum number of Steiner points. - Suding Liu (Optim. Lett., 2024)

The prize-collecting single machine scheduling with bounds and penalties. - Guojun Hu; Pengxiang Pan; Suding Liu; Ping Yang; Runtao Xie (J. Comb. Optim., 2024)