GZGengsheng Zhang
Gengsheng Zhang
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Gengsheng Zhang has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
Dongdong Jia
Hebei Univ Sci & Technol, Sch Sci, Shijiazhuang 050018, Peoples R China
5 shared publications- Bo Hou
School of Mathematics and Statistics, Henan University, Kaifeng, China
4 shared publications - Wen Liu
School of Mathematical Sciences, Hebei Normal University, Shijiazhuang, People’s Republic of China
4 shared publications Jiayi Xie
School of Mathematical Sciences, Hebei Normal University, Shijiazhuang, China
3 shared publicationsZhengyu Guo
School of Mathematical Sciences, Hebei Normal University, Shijiazhuang 050024, China
3 shared publicationsSumei Zhang
School of Mathematics and Physics, Handan College, Handan, Hebei, People's Republic of China
2 shared publications
Latest Publications
- 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
- 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
- 17 October 2023
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 39 (6) , 1-52
On Quasi-strongly Regular Graphs with Parameters $(n,k,a;k-2,c_{2})$ (I)- 17 October 2023
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 39 (6) , 1-52
On Quasi-strongly Regular Graphs with Parameters $(n,k,a;k-2,c_{2})$ (I)- 24 August 2023
- Published by Elsevier in Discrete Mathematics
- Vol. 347 (1)
Spectra of quasi-strongly regular graphs
- 24 August 2023
- Published by Elsevier in Discrete Mathematics
- Vol. 347 (1)
Spectra of quasi-strongly regular graphs
- 3 April 2023
- Published by Elsevier in Discrete Mathematics
- Vol. 346 (8)
On quasi-strongly regular graphs with parameters (n,k,a;k − 2,c2) for a < k − 5
- 3 April 2023
- Published by Elsevier in Discrete Mathematics
- Vol. 346 (8)
On quasi-strongly regular graphs with parameters (n,k,a;k − 2,c2) for a < k − 5
- 16 August 2022
- Published by Taylor & Francis in Linear and Multilinear Algebra
- Vol. 71 (16) , 2585-2598
Symplectic totally isotropic subspace inclusion graph
Symplectic totally isotropic subspace inclusion graph on a finite-dimensional symplectic space is a graph whose vertices are all totally isotropic subspaces of and two distinct vertices are adjacent if and only if one is contained in other. In this paper, the diameter, girth, clique number, chromatic number of are studied. Furthermore, a necessary and sufficient condition is provided for to be Eulerian. It is shown that if two symplectic totally isotropic subspace inclusion graphs on symplectic space are isomorphic, then the two subspace inclusion graphs on corresponding vector space are also isomorphic. It is also shown that is non-planar.- 16 August 2022
- Published by Taylor & Francis in Linear and Multilinear Algebra
- Vol. 71 (16) , 2585-2598
Symplectic totally isotropic subspace inclusion graph
Symplectic totally isotropic subspace inclusion graph on a finite-dimensional symplectic space is a graph whose vertices are all totally isotropic subspaces of and two distinct vertices are adjacent if and only if one is contained in other. In this paper, the diameter, girth, clique number, chromatic number of are studied. Furthermore, a necessary and sufficient condition is provided for to be Eulerian. It is shown that if two symplectic totally isotropic subspace inclusion graphs on symplectic space are isomorphic, then the two subspace inclusion graphs on corresponding vector space are also isomorphic. It is also shown that is non-planar.- 8 April 2022
- Published by Elsevier in Discrete Mathematics
- Vol. 345 (8) , 112922
On the second neighbourhoods of quasi-strongly regular graphs
- 8 April 2022
- Published by Elsevier in Discrete Mathematics
- Vol. 345 (8) , 112922
On the second neighbourhoods of quasi-strongly regular graphs
- 9 March 2022
- Published by Elsevier in Discrete Mathematics
- Vol. 345 (7) , 112879
Minimum arc-cuts of normally regular digraphs and Deza digraphs
- 9 March 2022
- Published by Elsevier in Discrete Mathematics
- Vol. 345 (7) , 112879
Minimum arc-cuts of normally regular digraphs and Deza digraphs