Lichen Junran头像

Lichen Junran

Associate professor

Research direction:

Education:

  • Department:
  • ORCID:
  • DBLP:

10 Access

  • Email:
  • Office :
  • Introduction
  • Research
  • Teaching
  • Funding
  • Publications
  • Awards
  • Honor Reward
  • Admission

Introduction

Education

Work Experience

Social Position

Social Activities

Research

Teaching

Postgraduates

Funding

Vertical Project

Horizontal Project

Publications

1.Junran Lichen*, Cycle-connected mixed graphs and related problems, Journal of Combinatorial Optimization  (Springer), Volume45, Article number: 53 (2023) (accepted on 28 Dec 2022), Published online, 10 January 2023, https://doi.org/10.1007/s10878-022-00979-3

2.Junran Lichen, Lijian Cai, Jianping Li*, Suding Liu, Pengxiang Pan, and Wencheng Wang, Delay-constrained minimum shortest path trees and related problems, Theoretical Computer Science, Volume 941 (2023), 191-201, Available online, 17 November 2022, https://doi.org/10.1016/j.tcs.2022.11.014

3.Junran Lichen, Jianping Li*, Ko-Wei Lih and Xingxing Yu, Approximation algorithms for constructing required subgraphs using stock pieces of fixed length, Journal of Combinatorial Optimization, Volume 44, no.3, pages 1774–1795 (28 September 2022) , Published online: 17 February 2020

4.Junran Lichen, Jianping Li* and Ko-Wei Lih, Approximation algorithms for constructing specific subgraphs with minimum number of length-bounded stock pieces, Information Processing Letters, (Elsevier),  Volume 137, no.1, 11-16, 1 September 2018, https://doi.org/10.1016/j.ipl.2018.04.013

5.Junran Lichen, Jianping Li* and Ko-Wei Lih, Approximation algorithms for constructing spanning K-trees using stock pieces of bounded length, Optimization Letters (Springer), Volume 11, no.8,1663-1675, 1 September 2017, DOI: 10.1007/s11590-016-1078-5

6.Jianping Li*, Ping Yang, Junran Lichen, and Pengxiang Pan, Approximation algorithms for solving the trip-constrained vehicle routing cover problems, accepted by Journal of Combinatorial Optimization (JOCO) (22 Sep 2024), Published online: 19 October 2022, https://doi.org/10.1007/s10878-024-01216-9

7.Pengxiang Pan, Junran Lichen, and Jianping Li*, Approximation algorithms for solving the vertex-traversing-constrained mixed Chinese postman problem, accepted byJournal of Global Optimization (JOGO) (29 May 2024), Published online: 19 October 2022, https://doi.org/10.1007/s10898-024-01420-1 

8.Jianping Li*, Suding Liu, Junran Lichen, Pengxiang Pan, and Wencheng Wang, Approximation algorithms for solving the 1-line minimum Steiner tree of line segments problem, Journal of the Operations Research Society of China (JORC) (Springer), Volume 12, 729-755 (29 June 2024). Accepted: 01 Sep 2022; Published online: 19 October 2022, https://doi.org/10.1007/s40305-022-00437-1  

9.Pengxiang Pan, Junran Lichen, Wencheng Wang, Lijian Cai, and Jianping Li*, Approximation algorithms for solving the k-Chinese postman problem under interdiction budget constraints, accepted by Journal of the Operations Research Society of China (JORC) (17 Apr 2023), Published online: 29 May 2023, https://doi.org/10.1007/s40305-023-00488-y  




Awards

1. Young director of Graph Theory and Combinatorics Branch of Operations Research Society of China. 

2. Guest editor of Artificial Intelligence Research (CAAI) (a first-level journal of the Chinese Association for Artificial Intelligence).

3. Industry special commissioner of Beijing Association for Science and Technology. 

4. Reviewer of international journals Discrete Mathematics, Algorithms and Applications (DMAA), Operations Research for Health Care, Journal of Computational and Applied Mathematics, Mathematical Reviews, and SN Operations Research Forum.

Patent

Honor Reward

Admissions Information