Qinghua Wu

Publication Activity (10 Years)

Years Active: 2012-2024
Publications (10 Years): 56

Top Topics

Traveling Salesman

Hybrid Evolutionary

Top Venues

Comput. Oper. Res.

Eur. J. Oper. Res.

Publications

Yuji Zou, Jin-Kao Hao, Qinghua Wu
A reinforcement learning guided hybrid evolutionary algorithm for the latency location routing problem. CoRR (2024)
Pengfei He, Jin-Kao Hao, Qinghua Wu
A Multi-population Integrated Approach for Capacitated Location Routing. CoRR (2024)
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) (2024)
Mingming Zheng, Jin-Kao Hao, Qinghua Wu
Exact and heuristic solution approaches for the Generalized Independent Set Problem. Comput. Oper. Res. 164 (2024)
Yongliang Lu, Una Benlic, Qinghua Wu
An effective hybrid evolutionary algorithm for the set orienteering problem. Inf. Sci. 654 (2024)
Pengfei He, Jin-Kao Hao, Qinghua Wu
-median problem. Networks 83 (2) (2024)
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) (2024)
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 (2024)
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) (2024)
Yuji Zou, Jin-Kao Hao, Qinghua Wu
A reinforcement learning guided hybrid evolutionary algorithm for the latency location routing problem. Comput. Oper. Res. 170 (2024)
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) (2024)
Pengfei He, Jin-Kao Hao, Qinghua Wu
Hybrid genetic algorithm for undirected traveling salesman problems with profits. Networks 82 (3) (2023)
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 (2023)
Qinghua Wu, Zhe Sun, Una Benlic, Yongliang Lu
A parallel adaptive memory algorithm for the capacitated modular hub location problem. Comput. Oper. Res. 153 (2023)
Zhe Sun, Una Benlic, Mingjie Li, Qinghua Wu
Reinforcement learning based tabu search for the minimum load coloring problem. Comput. Oper. Res. 143 (2022)
Yongliang Lu, Jin-Kao Hao, Qinghua Wu
traveling salesman problem methods. PeerJ Comput. Sci. 8 (2022)
Qing Zhou, Jin-Kao Hao, Qinghua Wu
A hybrid evolutionary search for the generalized quadratic multiple knapsack problem. Eur. J. Oper. Res. 296 (3) (2022)
Mingjie Li, Jin-Kao Hao, Qinghua Wu
Learning-driven feasible and infeasible tabu search for airport gate assignment. Eur. J. Oper. Res. 302 (1) (2022)
Zhi-Zhong Zeng, Zhipeng Lü, Xin-Guo Yu, Qinghua Wu, Yang Wang, Zhou Zhou
A memetic algorithm based on edge-state learning for max-cut. Expert Syst. Appl. 209 (2022)
Yongliang Lu, Una Benlic, Qinghua Wu
A hybrid evolutionary algorithm for the capacitated minimum spanning tree problem. Comput. Oper. Res. 144 (2022)
Pengfei He, Jin-Kao Hao, Qinghua Wu
Grouping memetic search for the colored traveling salesmen problem. Inf. Sci. 570 (2021)
Yongliang Lu, Una Benlic, Qinghua Wu
A highly effective hybrid evolutionary algorithm for the covering salesman problem. Inf. Sci. 564 (2021)
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) (2021)
Qing Zhou, Jin-Kao Hao, Qinghua Wu
Responsive threshold search based memetic algorithm for balanced minimum sum-of-squares clustering. Inf. Sci. 569 (2021)
Bo Peng, Lifan Wu, Yang Wang, Qinghua Wu
Solving maximum quasi-clique problem by a hybrid artificial bee colony approach. Inf. Sci. 578 (2021)
Zhi Lu, Jin-Kao Hao, Qinghua Wu
A hybrid evolutionary algorithm for finding low conductance of large graphs. Future Gener. Comput. Syst. 106 (2020)
Yongliang Lu, Una Benlic, Qinghua Wu
An effective memetic algorithm for the generalized bike-sharing rebalancing problem. Eng. Appl. Artif. Intell. 95 (2020)
Qing Zhou, Jin-Kao Hao, Zhe Sun, Qinghua Wu
Memetic search for composing medical crews with equity and efficiency. Appl. Soft Comput. 94 (2020)
Wen Sun, Jin-Kao Hao, Wenyu Wang, Qinghua Wu
Memetic search for the equitable coloring problem. Knowl. Based Syst. 188 (2020)
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 (2020)
Mingjie Li, Jin-Kao Hao, Qinghua Wu
General swap-based multiple neighborhood adaptive search for the maximum balanced biclique problem. Comput. Oper. Res. 119 (2020)
Qing Zhou, Una Benlic, Qinghua Wu
An opposition-based memetic algorithm for the maximum quasi-clique problem. Eur. J. Oper. Res. 286 (1) (2020)
Yongliang Lu, Jin-Kao Hao, Qinghua Wu
Solving the Clustered Traveling Salesman Problem via TSP methods. CoRR (2020)
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) (2020)
Huaxiao Shen, Shengnan Shu, Hu Qin, Qinghua Wu
An exact algorithm for the multi-period inspector scheduling problem. Comput. Ind. Eng. 145 (2020)
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 (2020)
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 (2019)
Yongliang Lu, Una Benlic, Qinghua Wu, Bo Peng
Memetic algorithm for the multiple traveling repairman problem with profits. Eng. Appl. Artif. Intell. 80 (2019)
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) (2019)
Yongliang Lu, Jin-Kao Hao, Qinghua Wu
Hybrid evolutionary search for the traveling repairman problem with profits. Inf. Sci. 502 (2019)
Qing Zhou, Una Benlic, Qinghua Wu, Jin-Kao Hao
Heuristic search to the capacitated clustering problem. Eur. J. Oper. Res. 273 (2) (2019)
Wenyu Wang, Jin-Kao Hao, Qinghua Wu
Tabu search with feasible and infeasible searches for equitable coloring. Eng. Appl. Artif. Intell. 71 (2018)
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 (2018)
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 (2018)
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 (2018)
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) (2018)
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 (2018)
Wen Sun, Jin-Kao Hao, Xiangjing Lai, Qinghua Wu
Adaptive feasible and infeasible tabu search for weighted vertex coloring. Inf. Sci. 466 (2018)
Wen Sun, Jin-Kao Hao, Xiangjing Lai, Qinghua Wu
On feasible and infeasible search for equitable graph coloring. GECCO (2017)
Yang Wang, Qinghua Wu, Fred W. Glover
Effective metaheuristic algorithms for the minimum differential dispersion problem. Eur. J. Oper. Res. 258 (3) (2017)
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 (2016)
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) (2016)
Qinghua Wu, Jin-Kao Hao
A clique-based exact method for optimal winner determination in combinatorial auctions. Inf. Sci. (2016)
Qinghua Wu, Yang Wang, Zhipeng Lü
A tabu search based hybrid evolutionary algorithm for the max-cut problem. Appl. Soft Comput. 34 (2015)
Qinghua Wu, Jin-Kao Hao
A review on algorithms for maximum clique problems. Eur. J. Oper. Res. 242 (3) (2015)
Qinghua Wu, Jin-Kao Hao
Solving the winner determination problem via a weighted maximum clique heuristic. Expert Syst. Appl. 42 (1) (2015)
Qinghua Wu, Jin-Kao Hao
Memetic search for the max-bisection problem. Comput. Oper. Res. 40 (1) (2013)
Qinghua Wu, Jin-Kao Hao
A hybrid metaheuristic method for the Maximum Diversity Problem. Eur. J. Oper. Res. 231 (2) (2013)
Qinghua Wu, Jin-Kao Hao
Improved Lower Bounds for Sum Coloring via Clique Decomposition CoRR (2013)
Qinghua Wu, Jin-Kao Hao
An adaptive multistart tabu search approach to solve the maximum clique problem. J. Comb. Optim. 26 (1) (2013)
Qinghua Wu, Jin-Kao Hao
An Extraction and Expansion Approach for Graph Coloring. Asia Pac. J. Oper. Res. 30 (5) (2013)
Jin-Kao Hao, Qinghua Wu
Improving the extraction and expansion method for large graph coloring. Discret. Appl. Math. 160 (16-17) (2012)
Qinghua Wu, Jin-Kao Hao, Fred W. Glover
Multi-neighborhood tabu search for the maximum weight clique problem. Ann. Oper. Res. 196 (1) (2012)
Qinghua Wu, Jin-Kao Hao
An effective heuristic algorithm for sum coloring of graphs. Comput. Oper. Res. 39 (7) (2012)
Qinghua Wu, Jin-Kao Hao
Coloring large graphs based on independent set extraction. Comput. Oper. Res. 39 (2) (2012)
Qinghua Wu, Jin-Kao Hao
A Memetic Approach for the Max-Cut Problem. PPSN (2) (2012)