default search action
Zhang-Hua Fu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j24]Xiangjing Lai
, Jin-Kao Hao
Global optimization and structural analysis of Coulomb and logarithmic potentials on the unit sphere using a population-based heuristic approach. Expert Syst. Appl. 238(Part A): 121704 (2024) - [j23]Yangming Zhou
Bi-Trajectory Hybrid Search to Solve Bottleneck-Minimized Colored Traveling Salesman Problems. IEEE Trans Autom. Sci. Eng. 21(1): 895-905 (2024) - 2023
- [j22]Jintong Ren, Jin-Kao Hao
An effective hybrid search algorithm for the multiple traveling repairman problem with profits. Eur. J. Oper. Res. 304(2): 381-394 (2023) - [j21]Shan Hu, Yi Zhou, Mingyu Xiao
Listing maximal k-relaxed-vertex connected components from large graphs. Inf. Sci. 620: 67-83 (2023) - [j20]Hua Jiang, Ke Bai, Hai-Jiao Liu, Chu-Min Li, Felip Manyà, Zhang-Hua Fu:
Parallel Bounded Search for the Maximum Clique Problem. J. Comput. Sci. Technol. 38(5): 1187-1202 (2023) - [i6]Zhang-Hua Fu, Sipeng Sun, Jintong Ren, Tianshu Yu, Haoyu Zhang
A Hierarchical Destroy and Repair Approach for Solving Very Large-Scale Travelling Salesman Problem. CoRR abs/2308.04639 (2023) - 2022
- [j19]Xiangjing Lai, Jin-Kao Hao
Iterated dynamic thresholding search for packing equal circles into a circular container. Eur. J. Oper. Res. 299(1): 137-153 (2022) - [j18]Jintong Ren, Jin-Kao Hao
Intensification-driven local search for the traveling repairman problem with profits. Expert Syst. Appl. 202: 117072 (2022) - [j17]Yiyao Zhu, Yongquan Chen, Zhang-Hua Fu
Knowledge-guided two-stage memetic search for the pickup and delivery traveling salesman problem with FIFO loading. Knowl. Based Syst. 242: 108332 (2022) - [j16]Yan Jin
Clustering Driven Iterated Hybrid Search for Vertex Bisection Minimization. IEEE Trans. Computers 71(10): 2370-2380 (2022) - [j15]Yangming Zhou
Multi-Neighborhood Simulated Annealing-Based Iterated Local Search for Colored Traveling Salesman Problems. IEEE Trans. Intell. Transp. Syst. 23(9): 16072-16082 (2022) - [c12]Wanjie Tao, Zhang-Hua Fu, Liangyue Li, Zulong Chen, Hong Wen, Yuanyuan Liu, Qijie Shen, Peilin Chen:
A Dual Channel Intent Evolution Network for Predicting Period-Aware Travel Intentions at Fliggy. CIKM 2022: 3524-3533 - [c11]Shiqing Fu, Jian Li, Zhang-Hua Fu:
Cooperatively Scheduling Hundreds of Fetch and Freight Robots in an Autonomous Warehouse. RCAR 2022: 469-474 - 2021
- [j14]Xiangjing Lai, Jin-Kao Hao, Zhang-Hua Fu, Dong Yue:
Neighborhood decomposition-driven variable neighborhood search for capacitated clustering. Comput. Oper. Res. 134: 105362 (2021) - [j13]Xiangjing Lai, Jin-Kao Hao
Neighborhood decomposition based variable neighborhood search and tabu search for maximally diverse grouping. Eur. J. Oper. Res. 289(3): 1067-1086 (2021) - [j12]Yuanyuan Liu, Jiyao Peng, Jing-Hao Xue, Yongquan Chen, Zhang-Hua Fu:
TSingNet: Scale-aware and context-rich feature learning for traffic sign detection and recognition in the wild. Neurocomputing 447: 10-22 (2021) - [j11]Yangming Zhou
Late acceptance-based heuristic algorithms for identifying critical nodes of weighted graphs. Knowl. Based Syst. 211: 106562 (2021) - [j10]Yangming Zhou
Variable Population Memetic Search: A Case Study on the Critical Node Problem. IEEE Trans. Evol. Comput. 25(1): 187-200 (2021) - [c10]Qianggang Ding, Sifan Wu, Tao Dai, Hao Sun, Jiadong Guo, Zhang-Hua Fu, Shutao Xia:
Knowledge Refinery: Learning from Decoupled Label. AAAI 2021: 7228-7235 - [c9]Zhang-Hua Fu, Kai-Bin Qiu, Hongyuan Zha:
Generalize a Small Pre-trained Model to Arbitrarily Large TSP Instances. AAAI 2021: 7474-7482 - [c8]Yi Zhou, Shan Hu, Mingyu Xiao, Zhang-Hua Fu:
Improving Maximum k-plex Solver via Second-Order Reduction and Graph Color Bounding. AAAI 2021: 12453-12460 - [c7]Yangming Zhou, Wenqiang Xu, Zhang-Hua Fu, Mengchu Zhou:
Solving Colored Traveling Salesman Problem via Multi-neighborhood Simulated Annealing Search. ICNSC 2021: 1-6 - [c6]Lianxin Zhang, Zhang-Hua Fu, Hengli Liu, Qingquan Liu, Xiaoqiang Ji, Huihuan Qian:
An Efficient Parallel Self-assembly Planning Algorithm for Modular Robots in Environments with Obstacles. ICRA 2021: 10038-10044 - [c5]Hua Jiang, Dongming Zhu, Zhichao Xie, Shaowen Yao, Zhang-Hua Fu:
A New Upper Bound Based on Vertex Partitioning for the Maximum K-plex Problem. IJCAI 2021: 1689-1696 - [i5]Jintong Ren, Jin-Kao Hao, Feng Wu, Zhang-Hua Fu:
An effective hybrid search algorithm for the multiple traveling repairman problem with profits. CoRR abs/2111.05017 (2021) - [i4]Xuwei Tan, Yangming Zhou, Zhang-Hua Fu, Mengchu Zhou:
Feature Importance-aware Graph Attention Network and Dueling Double Deep Q-Network Combined Approach for Critical Node Detection Problems. CoRR abs/2112.03404 (2021) - 2020
- [j9]Xiangjing Lai, Jin-Kao Hao
Diversity-preserving quantum particle swarm optimization for the multidimensional knapsack problem. Expert Syst. Appl. 149: 113310 (2020) - [j8]Wei Li
Multipopulation cooperative particle swarm optimization with a mixed mutation strategy. Inf. Sci. 529: 179-196 (2020) - [c4]Ying Song, Shuangjia Zheng, Zhangming Niu, Zhang-Hua Fu, Yutong Lu, Yuedong Yang:
Communicative Representation Learning on Attributed Molecular Graphs. IJCAI 2020: 2831-2838 - [i3]Zhang-Hua Fu, Kai-Bin Qiu, Hongyuan Zha:
Generalize a Small Pre-trained Model to Arbitrarily Large TSP Instances. CoRR abs/2012.10658 (2020)
2010 – 2019
- 2019
- [j7]Zhang-Hua Fu
Dynamically Reconstructing Minimum Spanning Trees After Swapping Pairwise Vertices. IEEE Access 7: 16351-16363 (2019) - [j6]Xiangjing Lai
A Tabu Search Approach With Dynamical Neighborhood Size for Solving the Maximum Min-Sum Dispersion Problem. IEEE Access 7: 181357-181368 (2019) - [c3]Hong Li, Si-Yang Liu, Yan-Wei Huang, Yong-Quan Chen, Zhang-Hua Fu:
An Efficient 2-opt Operator for the Robotic Task Sequencing Problem. RCAR 2019: 124-129 - [i2]Yangming Zhou, Jin-Kao Hao, Zhang-Hua Fu, Zhe Wang, Xiangjing Lai:
Variable Population Memetic Search: A Case Study on the Critical Node Problem. CoRR abs/1909.08691 (2019) - 2018
- [c2]Yi-Fei Ming, Si-Bo Chen, Yong-Quan Chen, Zhang-Hua Fu:
A Fast Vertex-Swap Operator for the Prize-Collecting Steiner Tree Problem. ICCS (2) 2018: 553-560 - [c1]Yan-Wei Huang, Chong-Feng Liu, Su-Feng Hu, Zhang-Hua Fu, Yong-Quan Chen:
Dynamic Task Sequencing of Manipulator by Monte Carlo Tree Search. ROBIO 2018: 569-574 - 2017
- [j5]Zhang-Hua Fu, Jin-Kao Hao:
Knowledge-guided local search for the prize-collecting Steiner tree problem in graphs. Knowl. Based Syst. 128: 78-92 (2017) - [j4]Zhang-Hua Fu, Jin-Kao Hao:
Swap-vertex based neighborhood for Steiner tree problems. Math. Program. Comput. 9(2): 297-320 (2017) - 2015
- [j3]Zhang-Hua Fu, Jin-Kao Hao:
A three-phase search approach for the quadratic minimum spanning tree problem. Eng. Appl. Artif. Intell. 46: 113-130 (2015) - [j2]Zhang-Hua Fu, Jin-Kao Hao:
Dynamic Programming Driven Memetic Search for the Steiner Tree Problem with Revenues, Budget, and Hop Constraints. INFORMS J. Comput. 27(2): 221-237 (2015) - 2014
- [j1]Zhang-Hua Fu, Jin-Kao Hao:
Breakout local search for the Steiner tree problem with revenue, budget and hop constraints. Eur. J. Oper. Res. 232(1): 209-220 (2014) - [i1]Zhang-Hua Fu, Jin-Kao Hao:
A Three-Phase Search Approach for the Quadratic Minimum Spanning Tree Problem. CoRR abs/1402.1379 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-22 20:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: