Junran Lichen
According to our database1,
Junran Lichen
authored at least 24 papers
between 2013 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2023
Combinatorial algorithms for solving the constrained knapsack problems with divisible item sizes and penalties.
Optim. Lett., November, 2023
Exact algorithms for solving the constrained parallel-machine scheduling problems with divisible processing times and penalties.
J. Comb. Optim., April, 2023
Theor. Comput. Sci., 2023
J. Comb. Optim., 2023
Proceedings of the Computing and Combinatorics - 29th International Conference, 2023
Proceedings of the Combinatorial Optimization and Applications, 2023
2022
Approximation algorithms for solving the line-capacitated minimum Steiner tree problem.
J. Glob. Optim., 2022
Approximation algorithms for constructing required subgraphs using stock pieces of fixed length.
J. Comb. Optim., 2022
The Constrained Parallel-Machine Scheduling Problem with Divisible Processing Times and Penalties.
Proceedings of the Algorithmic Aspects in Information and Management, 2022
2021
On the minimum number of Steiner points of constrained 1-line-fixed Steiner tree in the Euclidean plane ${\mathbb {R}}^2$.
Optim. Lett., 2021
Proceedings of the Algorithmic Aspects in Information and Management, 2021
2020
Approximation algorithms for solving the 1-line Euclidean minimum Steiner tree problem.
J. Comb. Optim., 2020
On Approximations for Constructing 1-Line Minimum Rectilinear Steiner Trees in the Euclidean Plane $\mathbb {R}^2$.
Proceedings of the Algorithmic Aspects in Information and Management, 2020
2019
Improved approximation algorithms for the combination problem of parallel machine scheduling and path.
J. Comb. Optim., 2019
On Approximations for Constructing Required Subgraphs Using Stock Pieces of Fixed Length.
Proceedings of the Algorithmic Aspects in Information and Management, 2019
2018
Approximation algorithms for constructing specific subgraphs with minimum number of length-bounded stock pieces.
Inf. Process. Lett., 2018
2017
Approximation algorithms for constructing spanning K-trees using stock pieces of bounded length.
Optim. Lett., 2017
Proceedings of the Combinatorial Optimization and Applications, 2017
2014
Eur. J. Oper. Res., 2014
2013
Approximations for two variants of the Steiner tree problem in the Euclidean plane $${\mathbb{R}^2}$$.
J. Glob. Optim., 2013