Lijian Cai

According to our database, Lijian Cai authored at least 7 papers between 2021 and 2026.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2026

Exact combinatorial algorithms for solving the bin covering problems with strong divisibility and rejection profit.

Jianping Li, Lijian Cai, Junran Lichen, Pengxiang Pan

Optim. Lett., January, 2026

2024

Algorithms for the Constrained Assignment Problems with Bounds and Maximum Penalty.

Guojun Hu, Pengxiang Pan, Junran Lichen, Lijian Cai

Proceedings of the Algorithmic Aspects in Information and Management, 2024

2023

Combinatorial algorithms for solving the constrained knapsack problems with divisible item sizes and penalties.

Jianping Li, Lijian Cai, Junran Lichen, Pengxiang Pan

Optim. Lett., November, 2023

Approximation algorithms for solving the heterogeneous Chinese postman problem.

Jianping Li, Pengxiang Pan, Junran Lichen, Lijian Cai, Wencheng Wang, Suding Liu

J. Comb. Optim., 2023

2022

Bin packing with divisible item sizes and rejection penalties.

Jianping Li, Pengxiang Pan, Lijian Cai, Junran Lichen, Wencheng Wang

Optim. Lett., 2022

2021

Delay-Constrained Minimum Shortest Path Trees and Related Problems.

Junran Lichen, Lijian Cai, Jianping Li, Suding Liu, Pengxiang Pan, Wencheng Wang

Proceedings of the Combinatorial Optimization and Applications, 2021

An Approximation Algorithm for Solving the Heterogeneous Chinese Postman Problem.

Jianping Li, Lijian Cai, Junran Lichen, Pengxiang Pan, Wencheng Wang, Suding Liu

Proceedings of the Algorithmic Aspects in Information and Management, 2021