WLWen Liu
Wen Liu
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Wen Liu has a total of 31 co-authors. Here are the top co-authors by number of shared publications:
- Bo Hou
School of Mathematics and Statistics, Henan University, Kaifeng, China
13 shared publications Bo Hou
School of Mathematical Sciences, Hebei Normal University, Shijiazhuang, People’s Republic of China
5 shared publications- Gengsheng Zhang
School of Mathematical Sciences, Hebei Normal University, Shijiazhuang, People’s Republic of China
4 shared publications Jiaxuan Zhang
Hebei Normal University
4 shared publicationsSuogang Gao
Hebei Normal University
4 shared publications- Suogang Gao
School of Mathematical Sciences, Hebei Normal University, Shijiazhuang, P. R. China
3 shared publications
Latest Publications
- 25 October 2026
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 52 (4) , 43
An approximation algorithm for the prize-collecting partial scenario set cover problem
- 25 October 2026
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 52 (4) , 43
An approximation algorithm for the prize-collecting partial scenario set cover problem
- 23 September 2026
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 52 (3) , 30
Greedy approximation for the minimum (1, m)-connected dominating set with labeling
- 23 September 2026
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 52 (3) , 30
Greedy approximation for the minimum (1, m)-connected dominating set with labeling
- 23 September 2026
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 52 (3) , 26
An FPT approximation algorithm for the partition set cover problem with penalties
- 23 September 2026
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 52 (3) , 26
An FPT approximation algorithm for the partition set cover problem with penalties
- 21 May 2025
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 49 (5) , 1-15
Approximation algorithms for the partition set cover problem with penalties
- 21 May 2025
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 49 (5) , 1-15
Approximation algorithms for the partition set cover problem with penalties
- 21 May 2025
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 49 (5) , 1-13
Approximation algorithms for the W-prize-collecting scheduling problem on a single machine with submodular rejection penalties
- 21 May 2025
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 49 (5) , 1-13
Approximation algorithms for the W-prize-collecting scheduling problem on a single machine with submodular rejection penalties
- 4 May 2025
- Published by Springer Nature
- p. 26-35
An Approximation Algorithm for the (Metric) Clustered Path Traveling Salesman Problem
- 4 May 2025
- Published by Springer Nature
- p. 26-35
An Approximation Algorithm for the (Metric) Clustered Path Traveling Salesman Problem
- 1 January 2025
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Industrial and Management Optimization
The W-prize-collecting scheduling problem on parallel machines with release dates and rejection
In this paper, we consider the $ W $-prize-collecting scheduling problem on parallel machines with release dates and rejection. In this problem, we are given a set of $ n $ jobs, a set of $ m $ identical parallel machines, and a value $ W $. Each job has a processing time, a rejection penalty, a release date, and a profit. Each job is either accepted and processed on one of the machines after its corresponding release date, or rejected and a rejection penalty is paid. The objective is to minimize the sum of the makespan of accepted jobs and the total rejection penalties of rejected jobs, provided that the total profit of accepted jobs is not less than $ W $. We design a $ (2+\frac{1}{m}) $-approximation algorithm for the problem based on the greedy method.- 1 January 2025
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Industrial and Management Optimization
The W-prize-collecting scheduling problem on parallel machines with release dates and rejection
In this paper, we consider the $ W $-prize-collecting scheduling problem on parallel machines with release dates and rejection. In this problem, we are given a set of $ n $ jobs, a set of $ m $ identical parallel machines, and a value $ W $. Each job has a processing time, a rejection penalty, a release date, and a profit. Each job is either accepted and processed on one of the machines after its corresponding release date, or rejected and a rejection penalty is paid. The objective is to minimize the sum of the makespan of accepted jobs and the total rejection penalties of rejected jobs, provided that the total profit of accepted jobs is not less than $ W $. We design a $ (2+\frac{1}{m}) $-approximation algorithm for the problem based on the greedy method.- 13 October 2024
- Published by Springer Nature in Optimization Letters
- Vol. 19 (5) , 1007-1016
An approximation algorithm for the k-prize-collecting hitting set problem
- 13 October 2024
- Published by Springer Nature in Optimization Letters
- Vol. 19 (5) , 1007-1016
An approximation algorithm for the k-prize-collecting hitting set problem
- 11 October 2024
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 48 (3) , 1-9
W-prize-collecting scheduling problem on parallel machines
- 11 October 2024
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 48 (3) , 1-9
W-prize-collecting scheduling problem on parallel machines