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)

The restricted Chinese postman problems with penalties. - Hongtao Zhu; Pengxiang Pan (Oper. Res. Lett., 2021)

The Constrained Parallel-Machine Scheduling Problem with Divisible Processing Times and Penalties. - Jianping Li 007; Runtao Xie; Junran Lichen; Guojun Hu; Pengxiang Pan; Ping Yang (AAIM, 2022)

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)

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

The Heterogeneous Rooted Tree Cover Problem. - Pengxiang Pan; Junran Lichen; Ping Yang; Jianping Li 007 (COCOON (2), 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)

Exact algorithms for solving the constrained parallel-machine scheduling problems with divisible processing times and penalties. - Jianping Li 007; Runtao Xie; Junran Lichen; Guojun Hu; Pengxiang Pan; Ping Yang (J. Comb. Optim., 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)

Approximation algorithms for the restricted k-Chinese postman problems with penalties. - Pengxiang Pan; Hongtao Zhu (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)

Approximation algorithms for solving the trip-constrained vehicle routing cover problems. - Jianping Li 007; Ping Yang; Junran Lichen; Pengxiang Pan (J. Comb. Optim., 2024)

Approximation algorithms for solving the vertex-traversing-constrained mixed Chinese postman problem. - Pengxiang Pan; Junran Lichen; Jianping Li 007 (J. Glob. Optim., 2024)

A strongly polynomial time approximation algorithm for the min-max clustered cycle cover problem. - Pengxiang Pan; Hongtao Zhu (Theor. Comput. Sci., 2025)

Approximation algorithms for solving the heterogeneous rooted tree/path cover problems. - Pengxiang Pan; Junran Lichen; Ping Yang; Jianping Li 007 (J. Comb. Optim., 2025)