Get started
Author

Junran Lichen

Observed name: Jun-Ran Lichen
ORCID: 0000-0003-1385-8957
Observed ORCID: 0000-0003-1385-8957
OpenAlex ID: A5004025610
Approximation algorithms for solving the 1-line Euclidean minimum Steiner tree problem
2019 · Jianping Li, Suding Liu, et al. · Journal of Combinatorial Optimization · 12
Improved approximation algorithms for the combination problem of parallel machine scheduling and path
2019 · Li Guan, Jianping Li, et al. · Journal of Combinatorial Optimization · 8
Approximation algorithms for solving the heterogeneous Chinese postman problem
2022 · Jianping Li, Pengxiang Pan, et al. · Journal of Combinatorial Optimization · 7
Delay-constrained minimum shortest path trees and related problems
2022 · Junran Lichen, Lijian Cai, et al. · Theoretical Computer Science · 4
Approximation Algorithms for Solving the k-Chinese Postman Problem Under Interdiction Budget Constraints
2023 · Peng-Xiang Pan, Jun-Ran Lichen, et al. · Journal of the Operations Research Society of China · 3
Approximation algorithms for constructing required subgraphs using stock pieces of fixed length
2020 · Junran Lichen, Jianping Li, et al. · Journal of Combinatorial Optimization · 3
The constrained arborescence augmentation problem in digraphs
2017 · Jianping Li, Xiaofei Liu, et al. · IEEE International Conference on Computer and Communications (ICCC) · 3
Approximation algorithms for constructing some required structures in digraphs
2013 · Jianping Li, Yu Ge, et al. · European Journal of Operational Research · 3
Approximation algorithms for solving the trip-constrained vehicle routing cover problems
2024 · Jianping Li, Ping Yang, et al. · Journal of Combinatorial Optimization · 2
Approximation algorithms for solving the vertex-traversing-constrained mixed Chinese postman problem
2024 · Pengxiang Pan, Junran Lichen, et al. · Journal of Global Optimization · 2
An Approximation Algorithm for Solving the Heterogeneous Chinese Postman Problem
2021 · Jianping Li, Lijian Cai, et al. · Lecture notes in computer science · 2
Approximation algorithms for solving the heterogeneous rooted tree/path cover problems
2025 · Pengxiang Pan, Junran Lichen, et al. · Journal of Combinatorial Optimization · 1
On the Min-max Heterogeneous Weighted Delivery Problem
2025 · Jianping Li, Ping Yang, et al. · Lecture notes in computer science · 1
The Heterogeneous Rooted Tree Cover Problem
2023 · Pengxiang Pan, Junran Lichen, et al. · Lecture notes in computer science · 1
Exact algorithms for solving the constrained parallel-machine scheduling problems with divisible processing times and penalties
2023 · Jianping Li, Runtao Xie, et al. · Journal of Combinatorial Optimization · 1
Approximation Algorithms for Constructing Steiner Trees in the Euclidean Plane $$\mathbb {R}^2$$ Using Stock Pieces of Materials with Fixed Length
2022 · Jian-Ping Li, Wen-Cheng Wang, et al. · Journal of the Operations Research Society of China · 1
Bin packing with divisible item sizes and rejection penalties
2021 · Jianping Li, Pengxiang Pan, et al. · Optimization Letters · 1
On the minimum number of Steiner points of constrained 1-line-fixed Steiner tree in the Euclidean plane $${\mathbb {R}}^2$$
2020 · Jianping Li, Yujie Zheng, et al. · Optimization Letters · 1
Approximation algorithms for constructing specific subgraphs with minimum number of length-bounded stock pieces
2018 · Junran Lichen, Jianping Li, et al. · Information Processing Letters · 1
Approximation algorithms for constructing spanning K-trees using stock pieces of bounded length
2016 · Junran Lichen, Jianping Li, et al. · Optimization Letters · 1
The subdivision-constrained routing requests problem
2012 · Jianping Li, Weidong Li, et al. · Journal of Combinatorial Optimization · 1
Exact algorithms for solving the constrained convex combinatorial assignment problems with bounds and maximum penalty
2026 · Guojun Hu, Pengxiang Pan, et al. · Journal of Combinatorial Optimization
Approximation algorithms for solving the constrained strong Steiner connectivity augmentation problem
2026 · Junran Lichen, Shuwen Ge, et al. · Journal of Combinatorial Optimization
A new kind of signed permutations in the view of context-free grammar
2026 · Zhibin Du, Hong Bian, et al. · Discrete Mathematics
Two approximation algorithms for solving the min–max heterogeneous weighted delivery problem
2026 · Jianping Li, Ping Yang, et al. · Journal of Combinatorial Optimization
Works count: 43
Citation count: 59
H-index: 4
I10-index: 1
Year
Topic
Type