default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDQinghua Wu 0002
Person information
- affiliation: Huazhong University of Science and Technology, School of Management, Wuhan, China
- affiliation (PhD 2013): University of Angers, France
Other persons with the same name
- Qinghua Wu — disambiguation page
- Qinghua Wu 0001 — Wuhan Institute of Technology, Faculty of Computer Science and Engineering, China
- Q. Henry Wu
![[0000-0002-0598-8367]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-0598-8367")
(aka: Q. H. Wu, Qing-Hua Wu 0003, Qinghua Wu 0003) — South China University of Technology, School of Electric Power Engineering, Guangdong, China (and 1 more) - Qinghua Wu 0004 — Chinese Academy of Sciences, Institute of Computing Technology, China (and 3 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j67]Mingming Zheng, Jin-Kao Hao, Qinghua Wu:
Exact and heuristic solution approaches for the Generalized Independent Set Problem. Comput. Oper. Res. 164: 106561 (2024)- [j66]Yuji Zou, Jin-Kao Hao, Qinghua Wu:
A reinforcement learning guided hybrid evolutionary algorithm for the latency location routing problem. Comput. Oper. Res. 170: 106758 (2024) - [j65]Mingjie Li, Jin-Kao Hao, Qinghua Wu:
A flow based formulation and a reinforcement learning based strategic oscillation for cross-dock door assignment. Eur. J. Oper. Res. 312(2): 473-492 (2024) - [j64]Qinghua Wu, Mu He, Jin-Kao Hao, Yongliang Lu:
An effective hybrid evolutionary algorithm for the clustered orienteering problem. Eur. J. Oper. Res. 313(2): 418-434 (2024) - [j63]Mu He, Qinghua Wu, Una Benlic, Yongliang Lu, Yuning Chen:
An effective multi-level memetic search with neighborhood reduction for the clustered team orienteering problem. Eur. J. Oper. Res. 318(3): 778-801 (2024) - [j62]Yongliang Lu, Una Benlic, Qinghua Wu:
An effective hybrid evolutionary algorithm for the set orienteering problem. Inf. Sci. 654: 119813 (2024) - [j61]Wen Sun, Chaofan Chen, Jin-Kao Hao, Wenlong Li, Qinghua Wu, Yuning Chen:
A knowledge-based iterated local search for the weighted total domination problem. Inf. Sci. 665: 120364 (2024) - [j60]Qing Zhou, Jin-Kao Hao, Zhong-Zhong Jiang, Qinghua Wu:
An effective hybrid search method for the quadratic knapsack problem with conflict graphs. J. Oper. Res. Soc. 75(5): 1000-1010 (2024) - [j59]Zequn Wei, Jin-Kao Hao, Jintong Ren, Qinghua Wu, Eduardo Rodriguez-Tello:
An intensification-driven search algorithm for the family traveling salesman problem with incompatibility constraints. Knowl. Based Syst. 302: 112378 (2024) - [j58]Pengfei He, Jin-Kao Hao, Qinghua Wu:
A hybrid genetic algorithm for the Hamiltonian p-median problem. Networks 83(2): 348-367 (2024) - [j57]Yuning Chen, Junhua Xue, Yangming Zhou, Qinghua Wu:
An Efficient Threshold Acceptance-Based Multi-Layer Search Algorithm for Capacitated Electric Vehicle Routing Problem. IEEE Trans. Intell. Transp. Syst. 25(6): 5867-5879 (2024) - [i5]Pengfei He, Jin-Kao Hao, Qinghua Wu:
A Multi-population Integrated Approach for Capacitated Location Routing. CoRR abs/2403.09361 (2024) - [i4]Yuji Zou, Jin-Kao Hao, Qinghua Wu:
A reinforcement learning guided hybrid evolutionary algorithm for the latency location routing problem. CoRR abs/2403.14405 (2024) - [i3]Xiangjing Lai, Zhenheng Lin, Jin-Kao Hao, Qinghua Wu:
An efficient optimization model and tabu search-based global optimization approach for continuous p-dispersion problem. CoRR abs/2405.16618 (2024) - 2023
- [j56]Qinghua Wu, Zhe Sun, Una Benlic, Yongliang Lu:
A parallel adaptive memory algorithm for the capacitated modular hub location problem. Comput. Oper. Res. 153: 106173 (2023) - [j55]Yuji Zou, Jin-Kao Hao, Qinghua Wu:
Breakout local search for the traveling salesman problem with job-times. Expert Syst. Appl. 225: 120020 (2023) - [j54]Wen Sun, Wenlong Li, Jin-Kao Hao, Qinghua Wu:
Learning-based multi-start iterated local search for the profit maximization set covering problem. Inf. Sci. 646: 119404 (2023) - [j53]Pengfei He, Jin-Kao Hao, Qinghua Wu:
Hybrid genetic algorithm for undirected traveling salesman problems with profits. Networks 82(3): 189-221 (2023) - [j52]Wen Sun, Jin-Kao Hao, Zihao Wu, Wenlong Li, Qinghua Wu:
Dynamic thresholding search for the feedback vertex set problem. PeerJ Comput. Sci. 9: e1245 (2023) - 2022
- [j51]Zhe Sun, Una Benlic, Mingjie Li, Qinghua Wu:
Reinforcement learning based tabu search for the minimum load coloring problem. Comput. Oper. Res. 143: 105745 (2022) - [j50]Yongliang Lu, Una Benlic, Qinghua Wu:
A hybrid evolutionary algorithm for the capacitated minimum spanning tree problem. Comput. Oper. Res. 144: 105799 (2022) - [j49]Qing Zhou, Jin-Kao Hao, Qinghua Wu:
A hybrid evolutionary search for the generalized quadratic multiple knapsack problem. Eur. J. Oper. Res. 296(3): 788-803 (2022) - [j48]Mingjie Li, Jin-Kao Hao, Qinghua Wu:
Learning-driven feasible and infeasible tabu search for airport gate assignment. Eur. J. Oper. Res. 302(1): 172-186 (2022) - [j47]Zhizhong Zeng, Zhipeng Lü, Xinguo Yu, Qinghua Wu, Yang Wang, Zhou Zhou:
A memetic algorithm based on edge-state learning for max-cut. Expert Syst. Appl. 209: 118077 (2022) - [j46]Mu He, Qinghua Wu, Yongliang Lu:
Breakout local search for the cyclic cutwidth minimization problem. J. Heuristics 28(5): 583-618 (2022) - [j45]Wen Sun, Jin-Kao Hao, Wenlong Li, Qinghua Wu:
An adaptive memetic algorithm for the bidirectional loop layout problem. Knowl. Based Syst. 258: 110002 (2022) - [j44]Yongliang Lu, Jin-Kao Hao, Qinghua Wu:
Solving the clustered traveling salesman problem via traveling salesman problem methods. PeerJ Comput. Sci. 8: e972 (2022) - 2021
- [j43]Zhongrui Wang, Qinghua Wu:
Carbon emission reduction and product collection decisions in the closed-loop supply chain with cap-and-trade regulation. Int. J. Prod. Res. 59(14): 4359-4383 (2021) - [j42]Zhixing Luo, Hu Qin, T. C. E. Cheng, Qinghua Wu, Andrew Lim:
A Branch-and-Price-and-Cut Algorithm for the Cable-Routing Problem in Solar Power Plants. INFORMS J. Comput. 33(2): 452-476 (2021) - [j41]Yongliang Lu, Una Benlic, Qinghua Wu:
A highly effective hybrid evolutionary algorithm for the covering salesman problem. Inf. Sci. 564: 144-162 (2021) - [j40]Qing Zhou, Jin-Kao Hao, Qinghua Wu:
Responsive threshold search based memetic algorithm for balanced minimum sum-of-squares clustering. Inf. Sci. 569: 184-204 (2021) - [j39]Pengfei He, Jin-Kao Hao, Qinghua Wu:
Grouping memetic search for the colored traveling salesmen problem. Inf. Sci. 570: 689-707 (2021) - [j38]Bo Peng, Lifan Wu, Yang Wang, Qinghua Wu:
Solving maximum quasi-clique problem by a hybrid artificial bee colony approach. Inf. Sci. 578: 214-235 (2021) - 2020
- [j37]Qing Zhou, Jin-Kao Hao, Zhe Sun, Qinghua Wu:
Memetic search for composing medical crews with equity and efficiency. Appl. Soft Comput. 94: 106440 (2020) - [j36]Huaxiao Shen, Shengnan Shu, Hu Qin, Qinghua Wu:
An exact algorithm for the multi-period inspector scheduling problem. Comput. Ind. Eng. 145: 106515 (2020) - [j35]Zhongrui Wang, Alexander E. I. Brownlee, Qinghua Wu:
Production and joint emission reduction decisions based on two-way cost-sharing contract under cap-and-trade regulation. Comput. Ind. Eng. 146: 106549 (2020) - [j34]Mingjie Li, Jin-Kao Hao, Qinghua Wu:
General swap-based multiple neighborhood adaptive search for the maximum balanced biclique problem. Comput. Oper. Res. 119: 104922 (2020) - [j33]Yongliang Lu, Una Benlic, Qinghua Wu:
An effective memetic algorithm for the generalized bike-sharing rebalancing problem. Eng. Appl. Artif. Intell. 95: 103890 (2020) - [j32]Qing Zhou, Una Benlic, Qinghua Wu:
An opposition-based memetic algorithm for the maximum quasi-clique problem. Eur. J. Oper. Res. 286(1): 63-83 (2020) - [j31]Zhi Lu, Jin-Kao Hao, Qinghua Wu:
A hybrid evolutionary algorithm for finding low conductance of large graphs. Future Gener. Comput. Syst. 106: 105-120 (2020) - [j30]Qinghua Wu, Yang Wang, Fred W. Glover:
Advanced Tabu Search Algorithms for Bipartite Boolean Quadratic Programs Guided by Strategic Oscillation and Path Relinking. INFORMS J. Comput. 32(1): 74-89 (2020) - [j29]Qing Zhou, Una Benlic, Qinghua Wu:
A memetic algorithm based on reformulation local search for minimum sum-of-squares clustering in networks. Inf. Sci. 541: 271-296 (2020) - [j28]Wen Sun, Jin-Kao Hao, Wenyu Wang, Qinghua Wu:
Memetic search for the equitable coloring problem. Knowl. Based Syst. 188 (2020) - [i2]Yongliang Lu, Jin-Kao Hao, Qinghua Wu:
Solving the Clustered Traveling Salesman Problem via TSP methods. CoRR abs/2007.05254 (2020)
2010 – 2019
- 2019
- [j27]Yongliang Lu, Una Benlic, Qinghua Wu:
A population algorithm based on randomized tabu thresholding for the multi-commodity pickup-and-delivery traveling salesman problem. Comput. Oper. Res. 101: 285-297 (2019) - [j26]Yongliang Lu, Una Benlic, Qinghua Wu, Bo Peng:
Memetic algorithm for the multiple traveling repairman problem with profits. Eng. Appl. Artif. Intell. 80: 35-47 (2019) - [j25]Qing Zhou, Una Benlic, Qinghua Wu, Jin-Kao Hao:
Heuristic search to the capacitated clustering problem. Eur. J. Oper. Res. 273(2): 464-487 (2019) - [j24]Jiawei Song, Yang Wang, Haibo Wang, Qinghua Wu, Abraham P. Punnen:
An effective multi-wave algorithm for solving the max-mean dispersion problem. J. Heuristics 25(4-5): 731-752 (2019) - [j23]Yongliang Lu, Jin-Kao Hao, Qinghua Wu:
Hybrid evolutionary search for the traveling repairman problem with profits. Inf. Sci. 502: 91-108 (2019) - 2018
- [j22]Qinghua Wu, Qing Zhou, Yan Jin, Jin-Kao Hao:
Minimum sum coloring for large graphs with extraction and backward expansion search. Appl. Soft Comput. 62: 1056-1065 (2018) - [j21]Yongliang Lu, Una Benlic, Qinghua Wu:
A hybrid dynamic programming and memetic algorithm to the Traveling Salesman Problem with Hotel Selection. Comput. Oper. Res. 90: 193-207 (2018) - [j20]Yongliang Lu, Una Benlic, Qinghua Wu:
Multi-restart iterative search for the pickup and delivery traveling salesman problem with FIFO loading. Comput. Oper. Res. 97: 18-30 (2018) - [j19]Wenyu Wang, Jin-Kao Hao, Qinghua Wu:
Tabu search with feasible and infeasible searches for equitable coloring. Eng. Appl. Artif. Intell. 71: 1-14 (2018) - [j18]Yongliang Lu, Una Benlic, Qinghua Wu:
A memetic algorithm for the Orienteering Problem with Mandatory Visits and Exclusionary Constraints. Eur. J. Oper. Res. 268(1): 54-69 (2018) - [j17]Yang Wang, Qinghua Wu, Abraham P. Punnen, Fred W. Glover:
Adaptive tabu search with strategic oscillation for the bipartite boolean quadratic programming problem with partitioned variables. Inf. Sci. 450: 284-300 (2018) - [j16]Wen Sun, Jin-Kao Hao, Xiangjing Lai, Qinghua Wu:
Adaptive feasible and infeasible tabu search for weighted vertex coloring. Inf. Sci. 466: 203-219 (2018) - 2017
- [j15]Yang Wang, Qinghua Wu, Fred W. Glover:
Effective metaheuristic algorithms for the minimum differential dispersion problem. Eur. J. Oper. Res. 258(3): 829-843 (2017) - [c2]Wen Sun, Jin-Kao Hao, Xiangjing Lai, Qinghua Wu:
On feasible and infeasible search for equitable graph coloring. GECCO 2017: 369-376 - 2016
- [j14]Jin Qin, Xianhao Xu, Qinghua Wu, T. C. E. Cheng:
Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem. Comput. Oper. Res. 66: 199-214 (2016) - [j13]Qinghua Wu, Jin-Kao Hao:
A clique-based exact method for optimal winner determination in combinatorial auctions. Inf. Sci. 334-335: 103-121 (2016) - [j12]Yang Wang, Jin-Kao Hao, Fred W. Glover, Zhipeng Lü, Qinghua Wu:
Solving the maximum vertex weight clique problem via binary quadratic programming. J. Comb. Optim. 32(2): 531-549 (2016) - 2015
- [j11]Qinghua Wu, Yang Wang, Zhipeng Lü:
A tabu search based hybrid evolutionary algorithm for the max-cut problem. Appl. Soft Comput. 34: 827-837 (2015) - [j10]Qinghua Wu, Jin-Kao Hao:
A review on algorithms for maximum clique problems. Eur. J. Oper. Res. 242(3): 693-709 (2015) - [j9]Qinghua Wu, Jin-Kao Hao:
Solving the winner determination problem via a weighted maximum clique heuristic. Expert Syst. Appl. 42(1): 355-365 (2015) - 2013
- [b1]Qinghua Wu:
The maximum clique problems with applications to graph coloring. (Problèmes de clique maximum avec applications à la coloration de graphe). University of Angers, France, 2013 - [j8]Qinghua Wu, Jin-Kao Hao:
An Extraction and Expansion Approach for Graph Coloring. Asia Pac. J. Oper. Res. 30(5) (2013) - [j7]Qinghua Wu, Jin-Kao Hao:
Memetic search for the max-bisection problem. Comput. Oper. Res. 40(1): 166-179 (2013) - [j6]Qinghua Wu, Jin-Kao Hao:
A hybrid metaheuristic method for the Maximum Diversity Problem. Eur. J. Oper. Res. 231(2): 452-464 (2013) - [j5]Qinghua Wu, Jin-Kao Hao:
An adaptive multistart tabu search approach to solve the maximum clique problem. J. Comb. Optim. 26(1): 86-108 (2013) - [i1]Qinghua Wu, Jin-Kao Hao:
Improved Lower Bounds for Sum Coloring via Clique Decomposition. CoRR abs/1303.6761 (2013) - 2012
- [j4]Qinghua Wu, Jin-Kao Hao, Fred W. Glover:
Multi-neighborhood tabu search for the maximum weight clique problem. Ann. Oper. Res. 196(1): 611-634 (2012) - [j3]Qinghua Wu, Jin-Kao Hao:
Coloring large graphs based on independent set extraction. Comput. Oper. Res. 39(2): 283-290 (2012) - [j2]Qinghua Wu, Jin-Kao Hao:
An effective heuristic algorithm for sum coloring of graphs. Comput. Oper. Res. 39(7): 1593-1600 (2012) - [j1]Jin-Kao Hao, Qinghua Wu:
Improving the extraction and expansion method for large graph coloring. Discret. Appl. Math. 160(16-17): 2397-2407 (2012) - [c1]Qinghua Wu, Jin-Kao Hao:
A Memetic Approach for the Max-Cut Problem. PPSN (2) 2012: 297-306
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-11-07 21:36 CET 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:
