Breakout local search for the Steiner tree problem with revenue, budget and hop constraints. - Zhang-Hua Fu; Jin-Kao Hao (Eur. J. Oper. Res., 2014)

A three-phase search approach for the quadratic minimum spanning tree problem. - Zhang-Hua Fu; Jin-Kao Hao (Eng. Appl. Artif. Intell., 2015)

Dynamic Programming Driven Memetic Search for the Steiner Tree Problem with Revenues, Budget, and Hop Constraints. - Zhang-Hua Fu; Jin-Kao Hao (INFORMS J. Comput., 2015)

Knowledge-guided local search for the prize-collecting Steiner tree problem in graphs. - Zhang-Hua Fu; Jin-Kao Hao (Knowl. Based Syst., 2017)

Swap-vertex based neighborhood for Steiner tree problems. - Zhang-Hua Fu; Jin-Kao Hao (Math. Program. Comput., 2017)

A Fast Vertex-Swap Operator for the Prize-Collecting Steiner Tree Problem. - Yi-Fei Ming; Si-Bo Chen; Yong-Quan Chen; Zhang-Hua Fu (ICCS (2), 2018)

Dynamic Task Sequencing of Manipulator by Monte Carlo Tree Search. - Yan-Wei Huang; Chong-Feng Liu; Su-Feng Hu; Zhang-Hua Fu; Yong-Quan Chen (ROBIO, 2018)

An Efficient 2-opt Operator for the Robotic Task Sequencing Problem. - Hong Li; Si-Yang Liu; Yan-Wei Huang; Yong-Quan Chen; Zhang-Hua Fu (RCAR, 2019)

Dynamically Reconstructing Minimum Spanning Trees After Swapping Pairwise Vertices. - Zhang-Hua Fu; Si-Bo Chen; Yi-Fei Ming; Yong-Quan Chen; Xiangjing Lai (IEEE Access, 2019)

A Tabu Search Approach With Dynamical Neighborhood Size for Solving the Maximum Min-Sum Dispersion Problem. - Xiangjing Lai; Zhang-Hua Fu (IEEE Access, 2019)

Communicative Representation Learning on Attributed Molecular Graphs. - Ying Song; Shuangjia Zheng; Zhangming Niu; Zhang-Hua Fu; Yutong Lu; Yuedong Yang (IJCAI, 2020)

Diversity-preserving quantum particle swarm optimization for the multidimensional knapsack problem. - Xiangjing Lai; Jin-Kao Hao; Zhang-Hua Fu; Dong Yue 001 (Expert Syst. Appl., 2020)

Multipopulation cooperative particle swarm optimization with a mixed mutation strategy. - Wei Li 078; Xiang Meng 001; Ying Huang 001; Zhang-Hua Fu (Inf. Sci., 2020)

Knowledge Refinery: Learning from Decoupled Label. - Qianggang Ding; Sifan Wu; Tao Dai 001; Hao Sun; Jiadong Guo; Zhang-Hua Fu; Shutao Xia (AAAI, 2021)

Generalize a Small Pre-trained Model to Arbitrarily Large TSP Instances. - Zhang-Hua Fu; Kai-Bin Qiu; Hongyuan Zha (AAAI, 2021)

Improving Maximum k-plex Solver via Second-Order Reduction and Graph Color Bounding. - Yi Zhou 016; Shan Hu; Mingyu Xiao 001; Zhang-Hua Fu (AAAI, 2021)

Solving Colored Traveling Salesman Problem via Multi-neighborhood Simulated Annealing Search. - Yangming Zhou; Wenqiang Xu; Zhang-Hua Fu; Mengchu Zhou (ICNSC, 2021)

An Efficient Parallel Self-assembly Planning Algorithm for Modular Robots in Environments with Obstacles. - Lianxin Zhang; Zhang-Hua Fu; Hengli Liu; Qingquan Liu; Xiaoqiang Ji; Huihuan Qian (ICRA, 2021)

A New Upper Bound Based on Vertex Partitioning for the Maximum K-plex Problem. - Hua Jiang; Dongming Zhu; Zhichao Xie; Shaowen Yao 001; Zhang-Hua Fu (IJCAI, 2021)

Neighborhood decomposition-driven variable neighborhood search for capacitated clustering. - Xiangjing Lai; Jin-Kao Hao; Zhang-Hua Fu; Dong Yue 001 (Comput. Oper. Res., 2021)

Feature Importance-aware Graph Attention Network and Dueling Double Deep Q-Network Combined Approach for Critical Node Detection Problems. - Xuwei Tan; Yangming Zhou; Zhang-Hua Fu; Mengchu Zhou (CoRR, 2021)

Neighborhood decomposition based variable neighborhood search and tabu search for maximally diverse grouping. - Xiangjing Lai; Jin-Kao Hao; Zhang-Hua Fu; Dong Yue 001 (Eur. J. Oper. Res., 2021)

TSingNet: Scale-aware and context-rich feature learning for traffic sign detection and recognition in the wild. - Yuanyuan Liu 004; Jiyao Peng; Jing-Hao Xue; Yongquan Chen; Zhang-Hua Fu (Neurocomputing, 2021)

Late acceptance-based heuristic algorithms for identifying critical nodes of weighted graphs. - Yangming Zhou; Zhe Wang 002; Yan Jin 005; Zhang-Hua Fu (Knowl. Based Syst., 2021)

Variable Population Memetic Search: A Case Study on the Critical Node Problem. - Yangming Zhou; Jin-Kao Hao; Zhang-Hua Fu; Zhe Wang 002; Xiangjing Lai (IEEE Trans. Evol. Comput., 2021)

A Dual Channel Intent Evolution Network for Predicting Period-Aware Travel Intentions at Fliggy. - Wanjie Tao; Zhang-Hua Fu; Liangyue Li; Zulong Chen; Hong Wen 002; Yuanyuan Liu 004; Qijie Shen; Peilin Chen (CIKM, 2022)

Cooperatively Scheduling Hundreds of Fetch and Freight Robots in an Autonomous Warehouse. - Shiqing Fu; Jian Li; Zhang-Hua Fu (RCAR, 2022)

Iterated dynamic thresholding search for packing equal circles into a circular container. - Xiangjing Lai; Jin-Kao Hao; Dong Yue 001; Zhipeng Lü; Zhang-Hua Fu (Eur. J. Oper. Res., 2022)

Intensification-driven local search for the traveling repairman problem with profits. - Jintong Ren; Jin-Kao Hao; Feng Wu 001; Zhang-Hua Fu (Expert Syst. Appl., 2022)

Knowledge-guided two-stage memetic search for the pickup and delivery traveling salesman problem with FIFO loading. - Yiyao Zhu; Yongquan Chen; Zhang-Hua Fu (Knowl. Based Syst., 2022)

Clustering Driven Iterated Hybrid Search for Vertex Bisection Minimization. - Yan Jin 005; Bowen Xiong; Kun He 001; Jin-Kao Hao; Chu-Min Li 001; Zhang-Hua Fu (IEEE Trans. Computers, 2022)

Multi-Neighborhood Simulated Annealing-Based Iterated Local Search for Colored Traveling Salesman Problems. - Yangming Zhou; Wenqiang Xu; Zhang-Hua Fu; MengChu Zhou (IEEE Trans. Intell. Transp. Syst., 2022)

A Hierarchical Destroy and Repair Approach for Solving Very Large-Scale Travelling Salesman Problem. - Zhang-Hua Fu; Sipeng Sun; Jintong Ren; Tianshu Yu 001; Haoyu Zhang 001; Yuanyuan Liu 004; Lingxiao Huang; Xiang Yan; Pinyan Lu (CoRR, 2023)

An effective hybrid search algorithm for the multiple traveling repairman problem with profits. - Jintong Ren; Jin-Kao Hao; Feng Wu 001; Zhang-Hua Fu (Eur. J. Oper. Res., 2023)

Listing maximal k-relaxed-vertex connected components from large graphs. - Shan Hu; Yi Zhou 016; Mingyu Xiao 001; Zhang-Hua Fu; Zhipeng Lü (Inf. Sci., 2023)

Parallel Bounded Search for the Maximum Clique Problem. - Hua Jiang; Ke Bai; Hai-Jiao Liu; Chu-Min Li 001; Felip Manyà; Zhang-Hua Fu (J. Comput. Sci. Technol., 2023)

A Partition-and-Merge Algorithm for Solving the Steiner Tree Problem in Large Graphs. - Ming Sun 011; Xinyu Wu; Yi Zhou 016; Jin-Kao Hao; Zhang-Hua Fu (COCOON (2), 2024)

Bi-Trajectory Hybrid Search to Solve Bottleneck-Minimized Colored Traveling Salesman Problems. - Yangming Zhou; Wenqiang Xu; Mengchu Zhou; Zhang-Hua Fu (IEEE Trans Autom. Sci. Eng., 2024)

Global optimization and structural analysis of Coulomb and logarithmic potentials on the unit sphere using a population-based heuristic approach. - Xiangjing Lai; Jin-Kao Hao; Renbin Xiao; Zhang-Hua Fu (Expert Syst. Appl., 2024)

A problem reduction based memetic algorithm for the vehicle routing problem with discrete split deliveries and pickups. - Zheng Gao; Fuqin Deng; Zhang-Hua Fu; Xiangjing Lai; Qinghua Wu 002 (Comput. Oper. Res., 2025)

Structural optimization of atomic clusters using iterated dynamic lattice search: With application to silver clusters. - Xiangjing Lai; Jin-Kao Hao; Zhaolu Guo; Quan Wen; Zhang-Hua Fu (Comput. Phys. Commun., 2025)

Learning to Detect Critical Nodes in Sparse Graphs via Feature Importance Awareness. - Xuwei Tan; Yangming Zhou; MengChu Zhou; Zhang-Hua Fu (IEEE Trans Autom. Sci. Eng., 2025)

Efficient Training of Multi-task Neural Solver for Combinatorial Optimization. - Chenguang Wang 011; Zhang-Hua Fu; Pinyan Lu; Tianshu Yu 001 (Trans. Mach. Learn. Res., 2025)

Efficient Branch-and-Bound for Submodular Function Maximization under Knapsack Constraint. - Yimin Hao; Yi Zhou 016; Chao Xu; Zhang-Hua Fu (CoRR, 2025)