组合优化、近似算法

1.近年来主持或参与的代表性科研项目：

[1] 主持，云南省教育厅科学研究基金项目:最大利润网络设计问题（NO.2022Y050）,2022年3月-2023年2月，已结题。

2.近年来发表的代表性学术论文：

[1]Suding Liu.: Approximation algorithm for solving the 1-line Steiner tree problem with minimum number of Steiner points. Optimization Letters, 2024, 18:1421–1435.

[2]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, 2024, 12:729–755.

[3]Jianping Li, Suding Liu, Junran Lichen, Wencheng Wang, and Yvjie Zheng.: Approximation algorithms for solving the 1-line Euclidean minimum Steiner tree problem. Journal of Combinatorial Optimization, 2020, 39(2): 492–508.

[4]Jianping Li, Suding Liu, Junran Lichen: An exact algorithm for the line-constrained bottleneck k-Steiner tree problem. In: Proceedings of 17th International Conference on Combinatorial Optimization and Applications. Hawaii Cham: Springer Nature Switzerland, pp. 434–445 (2023).

[5]Jianping Li, Wencheng Wang, Junran Lichen, Suding Liu, and Pengxiang Pan.: Approximation algorithms for solving the line-capacitated minimum Steiner tree problem. Journal of Global Optimization, 2022, 84(3): 687–714.

[6]Junran Lichen, Lijian Cai, Jianping Li, Suding Liu, Pengxiang Pan, Wencheng Wang.: Delay-constrained minimum shortest path trees and related problems. Theoretical Computer Science, 2023, 941:191–201.

[7]Guojun Hu, Pengxiang Pan, Suding Liu, Ping Yang, and Runtao Xie. The prize-collecting single machine scheduling with bounds and penalties. Journal of Combinatorial Optimization, 2024, 48(2): 12.

[8]Jianping Li, Pengxiang Pan, Junran Lichen,Lijian Cai,Wencheng Wang, and Suding Liu.: Approximation algorithms for solving the heterogeneous Chinese postman problem. Journal of Combinatorial Optimization, 2023, 45(1): 17.

主讲图论与组合数学、运筹学、数学建模方法及应用。