A Memetic Approach for the Max-Cut Problem. - Qinghua Wu 002; Jin-Kao Hao (PPSN (2), 2012)

Multi-neighborhood tabu search for the maximum weight clique problem. - Qinghua Wu 002; Jin-Kao Hao; Fred W. Glover (Ann. Oper. Res., 2012)

Coloring large graphs based on independent set extraction. - Qinghua Wu 002; Jin-Kao Hao (Comput. Oper. Res., 2012)

An effective heuristic algorithm for sum coloring of graphs. - Qinghua Wu 002; Jin-Kao Hao (Comput. Oper. Res., 2012)

Improving the extraction and expansion method for large graph coloring. - Jin-Kao Hao; Qinghua Wu 002 (Discret. Appl. Math., 2012)

An Extraction and Expansion Approach for Graph Coloring. - Qinghua Wu 002; Jin-Kao Hao (Asia Pac. J. Oper. Res., 2013)

Memetic search for the max-bisection problem. - Qinghua Wu 002; Jin-Kao Hao (Comput. Oper. Res., 2013)

Improved Lower Bounds for Sum Coloring via Clique Decomposition - Qinghua Wu 002; Jin-Kao Hao (CoRR, 2013)

A hybrid metaheuristic method for the Maximum Diversity Problem. - Qinghua Wu 002; Jin-Kao Hao (Eur. J. Oper. Res., 2013)

An adaptive multistart tabu search approach to solve the maximum clique problem. - Qinghua Wu 002; Jin-Kao Hao (J. Comb. Optim., 2013)

The maximum clique problems with applications to graph coloring. (Problèmes de clique maximum avec applications à la coloration de graphe). - Qinghua Wu 002 (2013)

A tabu search based hybrid evolutionary algorithm for the max-cut problem. - Qinghua Wu 002; Yang Wang 030; Zhipeng Lü (Appl. Soft Comput., 2015)

A review on algorithms for maximum clique problems. - Qinghua Wu 002; Jin-Kao Hao (Eur. J. Oper. Res., 2015)

Solving the winner determination problem via a weighted maximum clique heuristic. - Qinghua Wu 002; Jin-Kao Hao (Expert Syst. Appl., 2015)

Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem. - Jin Qin; Xianhao Xu; Qinghua Wu 002; T. C. E. Cheng (Comput. Oper. Res., 2016)

A clique-based exact method for optimal winner determination in combinatorial auctions. - Qinghua Wu 002; Jin-Kao Hao (Inf. Sci., 2016)

Solving the maximum vertex weight clique problem via binary quadratic programming. - Yang Wang 030; Jin-Kao Hao; Fred W. Glover; Zhipeng Lü; Qinghua Wu 002 (J. Comb. Optim., 2016)

On feasible and infeasible search for equitable graph coloring. - Wen Sun 005; Jin-Kao Hao; Xiangjing Lai; Qinghua Wu 002 (GECCO, 2017)

Effective metaheuristic algorithms for the minimum differential dispersion problem. - Yang Wang 030; Qinghua Wu 002; Fred W. Glover (Eur. J. Oper. Res., 2017)

Minimum sum coloring for large graphs with extraction and backward expansion search. - Qinghua Wu 002; Qing Zhou; Yan Jin 005; Jin-Kao Hao (Appl. Soft Comput., 2018)

A hybrid dynamic programming and memetic algorithm to the Traveling Salesman Problem with Hotel Selection. - Yongliang Lu; Una Benlic; Qinghua Wu 002 (Comput. Oper. Res., 2018)

Multi-restart iterative search for the pickup and delivery traveling salesman problem with FIFO loading. - Yongliang Lu; Una Benlic; Qinghua Wu 002 (Comput. Oper. Res., 2018)

Tabu search with feasible and infeasible searches for equitable coloring. - Wenyu Wang; Jin-Kao Hao; Qinghua Wu 002 (Eng. Appl. Artif. Intell., 2018)

A memetic algorithm for the Orienteering Problem with Mandatory Visits and Exclusionary Constraints. - Yongliang Lu; Una Benlic; Qinghua Wu 002 (Eur. J. Oper. Res., 2018)

Adaptive feasible and infeasible tabu search for weighted vertex coloring. - Wen Sun 005; Jin-Kao Hao; Xiangjing Lai; Qinghua Wu 002 (Inf. Sci., 2018)

Adaptive tabu search with strategic oscillation for the bipartite boolean quadratic programming problem with partitioned variables. - Yang Wang 030; Qinghua Wu 002; Abraham P. Punnen; Fred W. Glover (Inf. Sci., 2018)

A population algorithm based on randomized tabu thresholding for the multi-commodity pickup-and-delivery traveling salesman problem. - Yongliang Lu; Una Benlic; Qinghua Wu 002 (Comput. Oper. Res., 2019)

Memetic algorithm for the multiple traveling repairman problem with profits. - Yongliang Lu; Una Benlic; Qinghua Wu 002; Bo Peng 010 (Eng. Appl. Artif. Intell., 2019)

Heuristic search to the capacitated clustering problem. - Qing Zhou; Una Benlic; Qinghua Wu 002; Jin-Kao Hao (Eur. J. Oper. Res., 2019)

An effective multi-wave algorithm for solving the max-mean dispersion problem. - Jiawei Song; Yang Wang 030; Haibo Wang 001; Qinghua Wu 002; Abraham P. Punnen (J. Heuristics, 2019)

Hybrid evolutionary search for the traveling repairman problem with profits. - Yongliang Lu; Jin-Kao Hao; Qinghua Wu 002 (Inf. Sci., 2019)

Memetic search for composing medical crews with equity and efficiency. - Qing Zhou; Jin-Kao Hao; Zhe Sun; Qinghua Wu 002 (Appl. Soft Comput., 2020)

An exact algorithm for the multi-period inspector scheduling problem. - Huaxiao Shen; Shengnan Shu; Hu Qin; Qinghua Wu 002 (Comput. Ind. Eng., 2020)

Production and joint emission reduction decisions based on two-way cost-sharing contract under cap-and-trade regulation. - Zhongrui Wang; Alexander E. I. Brownlee; Qinghua Wu 002 (Comput. Ind. Eng., 2020)

General swap-based multiple neighborhood adaptive search for the maximum balanced biclique problem. - Mingjie Li; Jin-Kao Hao; Qinghua Wu 002 (Comput. Oper. Res., 2020)

Solving the Clustered Traveling Salesman Problem via TSP methods. - Yongliang Lu; Jin-Kao Hao; Qinghua Wu 002 (CoRR, 2020)

An effective memetic algorithm for the generalized bike-sharing rebalancing problem. - Yongliang Lu; Una Benlic; Qinghua Wu 002 (Eng. Appl. Artif. Intell., 2020)

An opposition-based memetic algorithm for the maximum quasi-clique problem. - Qing Zhou; Una Benlic; Qinghua Wu 002 (Eur. J. Oper. Res., 2020)

A hybrid evolutionary algorithm for finding low conductance of large graphs. - Zhi Lu; Jin-Kao Hao; Qinghua Wu 002 (Future Gener. Comput. Syst., 2020)

Advanced Tabu Search Algorithms for Bipartite Boolean Quadratic Programs Guided by Strategic Oscillation and Path Relinking. - Qinghua Wu 002; Yang Wang 030; Fred W. Glover (INFORMS J. Comput., 2020)

A memetic algorithm based on reformulation local search for minimum sum-of-squares clustering in networks. - Qing Zhou; Una Benlic; Qinghua Wu 002 (Inf. Sci., 2020)

Memetic search for the equitable coloring problem. - Wen Sun 005; Jin-Kao Hao; Wenyu Wang; Qinghua Wu 002 (Knowl. Based Syst., 2020)

Carbon emission reduction and product collection decisions in the closed-loop supply chain with cap-and-trade regulation. - Zhongrui Wang; Qinghua Wu 002 (Int. J. Prod. Res., 2021)

A Branch-and-Price-and-Cut Algorithm for the Cable-Routing Problem in Solar Power Plants. - Zhixing Luo; Hu Qin; T. C. E. Cheng; Qinghua Wu 002; Andrew Lim 001 (INFORMS J. Comput., 2021)

Grouping memetic search for the colored traveling salesmen problem. - Pengfei He; Jin-Kao Hao; Qinghua Wu 002 (Inf. Sci., 2021)

A highly effective hybrid evolutionary algorithm for the covering salesman problem. - Yongliang Lu; Una Benlic; Qinghua Wu 002 (Inf. Sci., 2021)

Solving maximum quasi-clique problem by a hybrid artificial bee colony approach. - Bo Peng 010; Lifan Wu; Yang Wang 098; Qinghua Wu 002 (Inf. Sci., 2021)

Responsive threshold search based memetic algorithm for balanced minimum sum-of-squares clustering. - Qing Zhou; Jin-Kao Hao; Qinghua Wu 002 (Inf. Sci., 2021)

A hybrid evolutionary algorithm for the capacitated minimum spanning tree problem. - Yongliang Lu; Una Benlic; Qinghua Wu 002 (Comput. Oper. Res., 2022)

Reinforcement learning based tabu search for the minimum load coloring problem. - Zhe Sun; Una Benlic; Mingjie Li; Qinghua Wu 002 (Comput. Oper. Res., 2022)

Learning-driven feasible and infeasible tabu search for airport gate assignment. - Mingjie Li; Jin-Kao Hao; Qinghua Wu 002 (Eur. J. Oper. Res., 2022)

A hybrid evolutionary search for the generalized quadratic multiple knapsack problem. - Qing Zhou; Jin-Kao Hao; Qinghua Wu 002 (Eur. J. Oper. Res., 2022)

A memetic algorithm based on edge-state learning for max-cut. - Zhizhong Zeng; Zhipeng Lü; Xinguo Yu; Qinghua Wu 002; Yang Wang 098; Zhou Zhou (Expert Syst. Appl., 2022)

Breakout local search for the cyclic cutwidth minimization problem. - Mu He; Qinghua Wu 002; Yongliang Lu (J. Heuristics, 2022)

An adaptive memetic algorithm for the bidirectional loop layout problem. - Wen Sun 005; Jin-Kao Hao; Wenlong Li; Qinghua Wu 002 (Knowl. Based Syst., 2022)

Solving the clustered traveling salesman problem via traveling salesman problem methods. - Yongliang Lu; Jin-Kao Hao; Qinghua Wu 002 (PeerJ Comput. Sci., 2022)

Dynamic thresholding search for the feedback vertex set problem. - Wen Sun 005; Jin-Kao Hao; Zihao Wu; Wenlong Li; Qinghua Wu 002 (PeerJ Comput. Sci., 2023)

A parallel adaptive memory algorithm for the capacitated modular hub location problem. - Qinghua Wu 002; Zhe Sun; Una Benlic; Yongliang Lu (Comput. Oper. Res., 2023)

Breakout local search for the traveling salesman problem with job-times. - Yuji Zou; Jin-Kao Hao; Qinghua Wu 002 (Expert Syst. Appl., 2023)

Learning-based multi-start iterated local search for the profit maximization set covering problem. - Wen Sun 005; Wenlong Li; Jin-Kao Hao; Qinghua Wu 002 (Inf. Sci., 2023)

Hybrid genetic algorithm for undirected traveling salesman problems with profits. - Pengfei He; Jin-Kao Hao; Qinghua Wu 002 (Networks, 2023)

Exact and heuristic solution approaches for the Generalized Independent Set Problem. - Mingming Zheng; Jin-Kao Hao; Qinghua Wu 002 (Comput. Oper. Res., 2024)

A reinforcement learning guided hybrid evolutionary algorithm for the latency location routing problem. - Yuji Zou; Jin-Kao Hao; Qinghua Wu 002 (Comput. Oper. Res., 2024)

A Multi-population Integrated Approach for Capacitated Location Routing. - Pengfei He; Jin-Kao Hao; Qinghua Wu 002 (CoRR, 2024)

An efficient optimization model and tabu search-based global optimization approach for continuous p-dispersion problem. - Xiangjing Lai; Zhenheng Lin; Jin-Kao Hao; Qinghua Wu 002 (CoRR, 2024)

An effective multi-level memetic search with neighborhood reduction for the clustered team orienteering problem. - Mu He; Qinghua Wu 002; Una Benlic; Yongliang Lu; Yuning Chen (Eur. J. Oper. Res., 2024)

A knowledge-based iterated local search for the weighted total domination problem. - Wen Sun 005; Chaofan Chen; Jin-Kao Hao; Wenlong Li; Qinghua Wu 002; Yuning Chen (Inf. Sci., 2024)

An intensification-driven search algorithm for the family traveling salesman problem with incompatibility constraints. - Zequn Wei; Jin-Kao Hao; Jintong Ren; Qinghua Wu 002; Eduardo Rodriguez-Tello (Knowl. Based Syst., 2024)

A flow based formulation and a reinforcement learning based strategic oscillation for cross-dock door assignment. - Mingjie Li; Jin-Kao Hao; Qinghua Wu 002 (Eur. J. Oper. Res., 2024)

An effective hybrid evolutionary algorithm for the set orienteering problem. - Yongliang Lu; Una Benlic; Qinghua Wu 002 (Inf. Sci., 2024)

An effective hybrid evolutionary algorithm for the clustered orienteering problem. - Qinghua Wu 002; Mu He; Jin-Kao Hao; Yongliang Lu (Eur. J. Oper. Res., 2024)

A hybrid genetic algorithm for the Hamiltonian p-median problem. - Pengfei He; Jin-Kao Hao; Qinghua Wu 002 (Networks, 2024)

An effective hybrid search method for the quadratic knapsack problem with conflict graphs. - Qing Zhou; Jin-Kao Hao; Zhong-Zhong Jiang; Qinghua Wu 002 (J. Oper. Res. Soc., 2024)

An Efficient Threshold Acceptance-Based Multi-Layer Search Algorithm for Capacitated Electric Vehicle Routing Problem. - Yuning Chen; Junhua Xue; Yangming Zhou; Qinghua Wu 002 (IEEE Trans. Intell. Transp. Syst., 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)

A cardinality constrained iterated local search for the virtual machine placement problem. - Qing Zhou; Yuru Li; Jin-Kao Hao; Qinghua Wu 002; Yuning Chen (Comput. Oper. Res., 2025)

An effective evolutionary algorithm for packing rectangles into a fixed size circular container. - Xiangjing Lai; Lei Wang; Jin-Kao Hao; Qinghua Wu 002 (Eur. J. Oper. Res., 2025)

An Efficient Optimization Model and Tabu Search-Based Global Optimization Approach for the Continuous p-Dispersion Problem. - Xiangjing Lai; Zhenheng Lin; Jin-Kao Hao; Qinghua Wu 002 (INFORMS J. Comput., 2025)

Wireless Capsule Endoscopy Diagnosis Using Prototype Self-Attention and Dynamic Curriculum Learning. - Xingcun Li; Qinghua Wu 002; Yuning Chen; Kun Wu; Lin Meng (IEEE Trans Autom. Sci. Eng., 2025)

A Two-Individual Evolutionary Algorithm for Cumulative Capacitated Vehicle Routing With Single and Multiple Depots. - Yuji Zou; Jin-Kao Hao; Qinghua Wu 002 (IEEE Trans. Evol. Comput., 2025)

Adaptive feasible and infeasible evolutionary search for the knapsack problem with forfeits. - Qing Zhou; Jin-Kao Hao; Zhong-Zhong Jiang; Qinghua Wu 002 (Int. Trans. Oper. Res., 2025)

Speeding up Local Optimization in Vehicle Routing with Tensor-based GPU Acceleration. - Zhenyu Lei; Jin-Kao Hao; Qinghua Wu 002 (CoRR, 2025)