The Constrained Parallel-Machine Scheduling Problem with Divisible Processing Times and Penalties. - Jianping Li 007; Runtao Xie; Junran Lichen; Guojun Hu; Pengxiang Pan; Ping Yang (AAIM, 2022)

A primal-dual approximation algorithm for the k-prize-collecting minimum power cover problem. - Xiaofei Liu; Weidong Li 002; Runtao Xie (Optim. Lett., 2022)

Exact algorithms for solving the constrained parallel-machine scheduling problems with divisible processing times and penalties. - Jianping Li 007; Runtao Xie; Junran Lichen; Guojun Hu; Pengxiang Pan; Ping Yang (J. Comb. Optim., 2023)

On the Constrained Steiner Strong Connectivity Augmentation Problem. - Junran Lichen; Shuwen Ge; Runtao Xie; Ping Yang (COCOA (1), 2024)

The prize-collecting single machine scheduling with bounds and penalties. - Guojun Hu; Pengxiang Pan; Suding Liu; Ping Yang; Runtao Xie (J. Comb. Optim., 2024)