Zhang-Hua Fu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Zhang-Hua Fu has a total of 54 co-authors. Here are the top co-authors by number of shared publications:
- Jin-Kao Hao
Department of Computer Science, LERIA Laboratory, University of Angers, Angers, France
7 shared publications - Xiangjing Lai
Institute of Advanced Technology, Nanjing University of Posts and Telecommunications,Nanjing,China
5 shared publications - Yangming Zhou
Data-Driven Management Decision Making Laboratory and the Sino-US Global Logistics Institute, Antai College of Economics and Management, Shanghai Jiao Tong University, Shanghai, China
5 shared publications - Yi Zhou
School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu China
4 shared publications - MengChu Zhou
Macau University of Science and Technology
3 shared publications - Chu-Min Li
Université de Picardie Jules Verne
2 shared publications
Latest Publications
- Open Access
- 19 October 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (20) , 3797
Group Behavior-Guided Multi-Density Graph Clustering for Large-Scale Telemarketing Recommendation
Large-scale telemarketing recommendation is crucial for personalized customer outreach in various industries like banking and telecommunications. However, traditional individual-level recommendation approaches suffer from high computational overhead in large-scale scenarios, making group-level recommendation a promising alternative. Nevertheless, existing group-level recommendation methods rely on distance-based similarity metrics that overlook long-tail density variations and decouple clustering from resource allocation, leading to suboptimal allocation decisions. To address these challenges, we propose a novel Group Behavior-guided Multi-density Graph Clustering (GBMGC) framework, which integrates multi-density behavior-aware graph clustering with constrained resource allocation optimization for efficient and scalable telemarketing recommendation. The framework adopts a two-stage design consisting of Density-aware Graph Clustering (DGC) and Group-guided Optimization Recommendation (GOR), with Tree-structured Parzen Estimator (TPE)-based hyperparameter selection. Specifically, to overcome the limitation of conventional distance-based similarity grouping in capturing long-tail behavioral density patterns, DGC constructs a weighted behavioral graph using heuristic weights derived from statistical tests on historical response distributions and applies adaptive density thresholds to identify groups with different population densities. In the second stage, based on the resulting group structure, GOR formulates the scheduling process as a constrained integer programming problem to maximize expected answer rates under practical constraints. Finally, TPE selects the key hyperparameters of DGC and GOR using validation-set performance as feedback, reducing manual hyperparameter search. Evaluated on a financial telemarketing test dataset with more than 3 M records and the MovieLens-1 M test dataset with approximately 0.2 M records, GBMGC achieves higher answer rate (AR) point estimates than the compared methods on the historically matched observations under the adopted offline evaluation protocol, while maintaining favorable computational efficiency. The results on MovieLens-1 M provide additional evidence of its applicability beyond the telemarketing recommendation setting.
- 19 October 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (20) , 3797
Open AccessGroup Behavior-Guided Multi-Density Graph Clustering for Large-Scale Telemarketing Recommendation
Large-scale telemarketing recommendation is crucial for personalized customer outreach in various industries like banking and telecommunications. However, traditional individual-level recommendation approaches suffer from high computational overhead in large-scale scenarios, making group-level recommendation a promising alternative. Nevertheless, existing group-level recommendation methods rely on distance-based similarity metrics that overlook long-tail density variations and decouple clustering from resource allocation, leading to suboptimal allocation decisions. To address these challenges, we propose a novel Group Behavior-guided Multi-density Graph Clustering (GBMGC) framework, which integrates multi-density behavior-aware graph clustering with constrained resource allocation optimization for efficient and scalable telemarketing recommendation. The framework adopts a two-stage design consisting of Density-aware Graph Clustering (DGC) and Group-guided Optimization Recommendation (GOR), with Tree-structured Parzen Estimator (TPE)-based hyperparameter selection. Specifically, to overcome the limitation of conventional distance-based similarity grouping in capturing long-tail behavioral density patterns, DGC constructs a weighted behavioral graph using heuristic weights derived from statistical tests on historical response distributions and applies adaptive density thresholds to identify groups with different population densities. In the second stage, based on the resulting group structure, GOR formulates the scheduling process as a constrained integer programming problem to maximize expected answer rates under practical constraints. Finally, TPE selects the key hyperparameters of DGC and GOR using validation-set performance as feedback, reducing manual hyperparameter search. Evaluated on a financial telemarketing test dataset with more than 3 M records and the MovieLens-1 M test dataset with approximately 0.2 M records, GBMGC achieves higher answer rate (AR) point estimates than the compared methods on the historically matched observations under the adopted offline evaluation protocol, while maintaining favorable computational efficiency. The results on MovieLens-1 M provide additional evidence of its applicability beyond the telemarketing recommendation setting.
- 3 July 2026
- Published by Elsevier in Knowledge-Based Systems
- Vol. 350
A branch-and-bound approach for maximum low-diameter dense subgraph problems
- 3 July 2026
- Published by Elsevier in Knowledge-Based Systems
- Vol. 350
A branch-and-bound approach for maximum low-diameter dense subgraph problems
- Open Access
A Branch-and-Bound Approach for Maximum Low-Diameter Dense Subgraph Problems
A graph with $n$ vertices is an $f(\cdot)$-dense graph if it has at least $f(n)$ edges, $f(\cdot)$ being a well-defined function. The notion $f(\cdot)$-dense graph encompasses various clique models like $γ$-quasi cliques, $k$-defective cliques, and dense cliques, arising in cohesive subgraph extraction applications. However, the $f(\cdot)$-dense graph may be disconnected or weakly connected. To conquer this, we study the problem of finding the largest $f(\cdot)$-dense subgraph with a diameter of at most two in the paper. Specifically, we present a decomposition-based branch-and-bound algorithm to optimally solve this problem. The key feature of the algorithm is a decomposition framework that breaks the graph into $n$ smaller subgraphs, allowing independent searches in each subgraph. We also introduce decomposition strategies including degeneracy and two-hop degeneracy orderings, alongside a branch-and-bound algorithm with a novel sorting-based upper bound to solve each subproblem. Worst-case complexity for each component is provided. Empirical results on 139 real-world graphs under two $f(\cdot)$ functions show our algorithm outperforms the MIP solver and pure branch-and-bound, solving nearly twice as many instances optimally within one hour.Open AccessA Branch-and-Bound Approach for Maximum Low-Diameter Dense Subgraph Problems
A graph with $n$ vertices is an $f(\cdot)$-dense graph if it has at least $f(n)$ edges, $f(\cdot)$ being a well-defined function. The notion $f(\cdot)$-dense graph encompasses various clique models like $γ$-quasi cliques, $k$-defective cliques, and dense cliques, arising in cohesive subgraph extraction applications. However, the $f(\cdot)$-dense graph may be disconnected or weakly connected. To conquer this, we study the problem of finding the largest $f(\cdot)$-dense subgraph with a diameter of at most two in the paper. Specifically, we present a decomposition-based branch-and-bound algorithm to optimally solve this problem. The key feature of the algorithm is a decomposition framework that breaks the graph into $n$ smaller subgraphs, allowing independent searches in each subgraph. We also introduce decomposition strategies including degeneracy and two-hop degeneracy orderings, alongside a branch-and-bound algorithm with a novel sorting-based upper bound to solve each subproblem. Worst-case complexity for each component is provided. Empirical results on 139 real-world graphs under two $f(\cdot)$ functions show our algorithm outperforms the MIP solver and pure branch-and-bound, solving nearly twice as many instances optimally within one hour. - Open Access
- 21 October 2025
- Published by IOS Press
- p. 911-918
Efficient Branch-and-Bound for Submodular Function Maximization Under Knapsack Constraint
The submodular knapsack problem (SKP), which seeks to maximize a submodular set function by selecting a subset of elements within a given budget, is an important discrete optimization problem. The majority of existing approaches to solving the SKP are approximation algorithms. However, in domains such as health-care facility location and risk management, the need for optimal solutions is still critical, necessitating the use of exact algorithms over approximation methods. In this paper, we present an optimal branch-and-bound approach, featuring a novel upper bound with a worst-case tightness guarantee and an efficient dual branching method to minimize repeated computations. Experiments in applications such as facility location, weighted coverage, influence maximization, and so on show that the algorithms that implement the new ideas are far more efficient than conventional methods.
- 21 October 2025
- Published by IOS Press
- p. 911-918
Open AccessEfficient Branch-and-Bound for Submodular Function Maximization Under Knapsack Constraint
The submodular knapsack problem (SKP), which seeks to maximize a submodular set function by selecting a subset of elements within a given budget, is an important discrete optimization problem. The majority of existing approaches to solving the SKP are approximation algorithms. However, in domains such as health-care facility location and risk management, the need for optimal solutions is still critical, necessitating the use of exact algorithms over approximation methods. In this paper, we present an optimal branch-and-bound approach, featuring a novel upper bound with a worst-case tightness guarantee and an efficient dual branching method to minimize repeated computations. Experiments in applications such as facility location, weighted coverage, influence maximization, and so on show that the algorithms that implement the new ideas are far more efficient than conventional methods.
- 20 February 2025
- Published by Springer Nature
- p. 128-139
A Partition-and-Merge Algorithm for Solving the Steiner Tree Problem in Large Graphs
- 20 February 2025
- Published by Springer Nature
- p. 128-139
A Partition-and-Merge Algorithm for Solving the Steiner Tree Problem in Large Graphs
- 22 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 22 (15455955) , 3772-3782
Learning to Detect Critical Nodes in Sparse Graphs via Feature Importance Awareness
Detecting critical nodes in sparse graphs is important in a variety of application domains, such as network vulnerability assessment, epidemic control, and drug design. The critical node problem (CNP) aims to find a set of critical nodes from a network whose deletion maximally degrades the pairwise connectivity of the residual network. Due to its general NP-hard nature, state-of-the-art CNP solutions are based on heuristic approaches. Domain knowledge and trial-and-error are usually required when designing such approaches, thus consuming considerable effort and time. This work proposes a feature importance-aware graph attention network for node representation and combines it with dueling double deep Q-network to create an end-to-end algorithm to solve CNP for the first time. It does not need any problem-specific knowledge or labeled datasets as required by most of existing methods. Once the model is trained, it can be generalized to cope with various types of CNPs (with different sizes and topological structures) without re-training. Computational experiments on 28 real-world networks show that the proposed method is highly comparable to state-of-the-art methods. It does not require any problem-specific knowledge and, hence, can be applicable to many applications including those impossible ones by using the existing approaches. It can be combined with some local search methods to further improve its solution quality. Extensive comparison results are given to show its effectiveness in solving CNP. Note to Practitioners —This work is motivated by the problems of identifying influential nodes from a sparse graph or network. Various practical applications can be naturally modeled as critical node problems, e.g., finding the most influential stations or airports within a transportation network, identifying a specific number of people to be vaccinated in order to reduce the overall transmissibility of a virus, and reinforcing the protection over some most important nodes to make the electric network more stable. It proposes an effective end-to-end deep learning algorithm to solve the critical node problem. The proposed approach combines feature importance-aware graph attention network with dueling double deep Q-network. Extensive numerical experiments and comparisons show that our proposed algorithm is highly comparable to state-of-the-art algorithms and can help decision-makers to discover valuable knowledge or influential nodes in a real-world network.
- 22 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 22 (15455955) , 3772-3782
Learning to Detect Critical Nodes in Sparse Graphs via Feature Importance Awareness
Detecting critical nodes in sparse graphs is important in a variety of application domains, such as network vulnerability assessment, epidemic control, and drug design. The critical node problem (CNP) aims to find a set of critical nodes from a network whose deletion maximally degrades the pairwise connectivity of the residual network. Due to its general NP-hard nature, state-of-the-art CNP solutions are based on heuristic approaches. Domain knowledge and trial-and-error are usually required when designing such approaches, thus consuming considerable effort and time. This work proposes a feature importance-aware graph attention network for node representation and combines it with dueling double deep Q-network to create an end-to-end algorithm to solve CNP for the first time. It does not need any problem-specific knowledge or labeled datasets as required by most of existing methods. Once the model is trained, it can be generalized to cope with various types of CNPs (with different sizes and topological structures) without re-training. Computational experiments on 28 real-world networks show that the proposed method is highly comparable to state-of-the-art methods. It does not require any problem-specific knowledge and, hence, can be applicable to many applications including those impossible ones by using the existing approaches. It can be combined with some local search methods to further improve its solution quality. Extensive comparison results are given to show its effectiveness in solving CNP. Note to Practitioners —This work is motivated by the problems of identifying influential nodes from a sparse graph or network. Various practical applications can be naturally modeled as critical node problems, e.g., finding the most influential stations or airports within a transportation network, identifying a specific number of people to be vaccinated in order to reduce the overall transmissibility of a virus, and reinforcing the protection over some most important nodes to make the electric network more stable. It proposes an effective end-to-end deep learning algorithm to solve the critical node problem. The proposed approach combines feature importance-aware graph attention network with dueling double deep Q-network. Extensive numerical experiments and comparisons show that our proposed algorithm is highly comparable to state-of-the-art algorithms and can help decision-makers to discover valuable knowledge or influential nodes in a real-world network.
- 30 September 2023
- Published by Springer Nature in Journal of Computer Science and Technology
- Vol. 38 (5) , 1187-1202
Parallel Bounded Search for the Maximum Clique Problem
- 30 September 2023
- Published by Springer Nature in Journal of Computer Science and Technology
- Vol. 38 (5) , 1187-1202
Parallel Bounded Search for the Maximum Clique Problem
- 31 May 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 21 (1) , 895-905
Bi-Trajectory Hybrid Search to Solve Bottleneck-Minimized Colored Traveling Salesman Problems
A bottleneck-minimized colored traveling salesman problem is an important variant of colored traveling salesman problems. It is useful in handling the planning problems with partially overlapped workspace such as the scheduling transportation resources for timely delivery of goods. In this work, we propose an efficient bi-trajectory hybrid search method for it. The proposed method integrates a route-based crossover operator to generate promising offspring solutions, a multi-neighborhood simulated annealing to perform local optimization, and a stagnation-detect-escape mechanism to help the search escape from local optima. We also propose a bidirectional adjacency solution representation method to encode a solution, which extends the traditional adjacency representation method by additionally employing an array to represent its reverse counterpart. Extensive evaluations on two sets of 58 widely used benchmark instances demonstrate that the proposed method significantly outperforms state-of-the-art algorithms. Investigations on key algorithm modules are performed to confirm the novelty and effectiveness of the proposed ideas and strategies. Finally, we verify the generalization of the proposed method via its use to solve a colored traveling salesman problem with its aim to balance workload among salesmen. Note to Practitioners —This work is motivated by the problems of scheduling transportation resources for timely delivery of goods. It proposes an effective bi-trajectory hybrid search to tackle bottleneck-minimized colored traveling salesman problem. The proposed approach performs bi-trajectory hybrid evolutionary search by maintaining only two individuals during the whole search process. Extensive numerical experiments and comparisons show that our proposed algorithm significantly outperforms state-of-the-art algorithms and can help decision-makers in designing best-routing solutions.
- 31 May 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 21 (1) , 895-905
Bi-Trajectory Hybrid Search to Solve Bottleneck-Minimized Colored Traveling Salesman Problems
A bottleneck-minimized colored traveling salesman problem is an important variant of colored traveling salesman problems. It is useful in handling the planning problems with partially overlapped workspace such as the scheduling transportation resources for timely delivery of goods. In this work, we propose an efficient bi-trajectory hybrid search method for it. The proposed method integrates a route-based crossover operator to generate promising offspring solutions, a multi-neighborhood simulated annealing to perform local optimization, and a stagnation-detect-escape mechanism to help the search escape from local optima. We also propose a bidirectional adjacency solution representation method to encode a solution, which extends the traditional adjacency representation method by additionally employing an array to represent its reverse counterpart. Extensive evaluations on two sets of 58 widely used benchmark instances demonstrate that the proposed method significantly outperforms state-of-the-art algorithms. Investigations on key algorithm modules are performed to confirm the novelty and effectiveness of the proposed ideas and strategies. Finally, we verify the generalization of the proposed method via its use to solve a colored traveling salesman problem with its aim to balance workload among salesmen. Note to Practitioners —This work is motivated by the problems of scheduling transportation resources for timely delivery of goods. It proposes an effective bi-trajectory hybrid search to tackle bottleneck-minimized colored traveling salesman problem. The proposed approach performs bi-trajectory hybrid evolutionary search by maintaining only two individuals during the whole search process. Extensive numerical experiments and comparisons show that our proposed algorithm significantly outperforms state-of-the-art algorithms and can help decision-makers in designing best-routing solutions.