Approximations for two variants of the Steiner tree problem in the Euclidean plane $${ mathbb{R}^2}$$. - Jianping Li 007; Haiyan Wang; Binchao Huang; Junran Lichen (J. Glob. Optim., 2013)

Approximation algorithms for constructing some required structures in digraphs. - Jianping Li 007; Yu Ge; Shuai He; Junran Lichen (Eur. J. Oper. Res., 2014)

The subdivision-constrained routing requests problem. - Jianping Li 007; Weidong Li 002; Junran Lichen (J. Comb. Optim., 2014)

Approximation Algorithms for the Generalized Stacker Crane Problem. - Jianping Li 007; Xiaofei Liu; Weidong Li 002; Li Guan; Junran Lichen (COCOA (1), 2017)

Approximation algorithms for constructing spanning K-trees using stock pieces of bounded length. - Junran Lichen; Jianping Li 007; Ko-Wei Lih (Optim. Lett., 2017)

Approximation algorithms for constructing specific subgraphs with minimum number of length-bounded stock pieces. - Junran Lichen; Jianping Li 007; Ko-Wei Lih (Inf. Process. Lett., 2018)

On Approximations for Constructing Required Subgraphs Using Stock Pieces of Fixed Length. - Junran Lichen; Jianping Li 007; Ko-Wei Lih; Xingxing Yu (AAIM, 2019)

Improved approximation algorithms for the combination problem of parallel machine scheduling and path. - Li Guan; Jianping Li 007; Weidong Li 002; Junran Lichen (J. Comb. Optim., 2019)

On Approximations for Constructing 1-Line Minimum Rectilinear Steiner Trees in the Euclidean Plane ℝ2. - Junran Lichen; Jianping Li 007; Wencheng Wang 003; Jean Yeh; Yeong-Nan Yeh; Xingxing Yu; Yujie Zheng (AAIM, 2020)

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)

On the minimum number of Steiner points of constrained 1-line-fixed Steiner tree in the Euclidean plane ${ mathbb {R}}^2$. - Jianping Li 007; Yujie Zheng; Junran Lichen; Wencheng Wang 003 (Optim. 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)

1-line minimum rectilinear steiner trees and related problems. - Jianping Li 007; Junran Lichen; Wencheng Wang 003; Jean Yeh; Yeong-Nan Yeh; Xingxing Yu; Yujie Zheng (J. Comb. Optim., 2022)

Approximation algorithms for constructing required subgraphs using stock pieces of fixed length. - Junran Lichen; Jianping Li 007; Ko-Wei Lih; Xingxing Yu (J. Comb. Optim., 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)

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

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)

Cycle-connected mixed graphs and related problems. - Junran Lichen (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)

On the Min-max Heterogeneous Weighted Delivery Problem. - Jianping Li 007; Ping Yang; Junran Lichen (COCOA (1), 2024)

On the Constrained Steiner Strong Connectivity Augmentation Problem. - Junran Lichen; Shuwen Ge; Runtao Xie; Ping Yang (COCOA (1), 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)

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