Qinghua Wu
Orcid: 0000-0003-4015-0305Affiliations:
- Huazhong University of Science and Technology, School of Management, Wuhan, China
- University of Angers, France (PhD 2013)
According to our database1,
Qinghua Wu
authored at least 74 papers
between 2012 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
An Efficient Threshold Acceptance-Based Multi-Layer Search Algorithm for Capacitated Electric Vehicle Routing Problem.
IEEE Trans. Intell. Transp. Syst., June, 2024
An effective hybrid search method for the quadratic knapsack problem with conflict graphs.
J. Oper. Res. Soc., May, 2024
Networks, March, 2024
Eur. J. Oper. Res., March, 2024
Inf. Sci., January, 2024
A flow based formulation and a reinforcement learning based strategic oscillation for cross-dock door assignment.
Eur. J. Oper. Res., January, 2024
An intensification-driven search algorithm for the family traveling salesman problem with incompatibility constraints.
Knowl. Based Syst., 2024
Inf. Sci., 2024
An effective multi-level memetic search with neighborhood reduction for the clustered team orienteering problem.
Eur. J. Oper. Res., 2024
An efficient optimization model and tabu search-based global optimization approach for continuous p-dispersion problem.
CoRR, 2024
A reinforcement learning guided hybrid evolutionary algorithm for the latency location routing problem.
Comput. Oper. Res., 2024
Comput. Oper. Res., 2024
2023
Networks, October, 2023
Learning-based multi-start iterated local search for the profit maximization set covering problem.
Inf. Sci., October, 2023
Expert Syst. Appl., September, 2023
A parallel adaptive memory algorithm for the capacitated modular hub location problem.
Comput. Oper. Res., May, 2023
PeerJ Comput. Sci., 2023
2022
Solving the clustered traveling salesman problem <i>via</i> traveling salesman problem methods.
PeerJ Comput. Sci., 2022
Knowl. Based Syst., 2022
J. Heuristics, 2022
Expert Syst. Appl., 2022
A hybrid evolutionary search for the generalized quadratic multiple knapsack problem.
Eur. J. Oper. Res., 2022
Eur. J. Oper. Res., 2022
Comput. Oper. Res., 2022
Comput. Oper. Res., 2022
2021
Responsive threshold search based memetic algorithm for balanced minimum sum-of-squares clustering.
Inf. Sci., 2021
Inf. Sci., 2021
Inf. Sci., 2021
A Branch-and-Price-and-Cut Algorithm for the Cable-Routing Problem in Solar Power Plants.
INFORMS J. Comput., 2021
Carbon emission reduction and product collection decisions in the closed-loop supply chain with cap-and-trade regulation.
Int. J. Prod. Res., 2021
2020
A memetic algorithm based on reformulation local search for minimum sum-of-squares clustering in networks.
Inf. Sci., 2020
Advanced Tabu Search Algorithms for Bipartite Boolean Quadratic Programs Guided by Strategic Oscillation and Path Relinking.
INFORMS J. Comput., 2020
Future Gener. Comput. Syst., 2020
Eur. J. Oper. Res., 2020
Eng. Appl. Artif. Intell., 2020
General swap-based multiple neighborhood adaptive search for the maximum balanced biclique problem.
Comput. Oper. Res., 2020
Production and joint emission reduction decisions based on two-way cost-sharing contract under cap-and-trade regulation.
Comput. Ind. Eng., 2020
Comput. Ind. Eng., 2020
Appl. Soft Comput., 2020
2019
Inf. Sci., 2019
J. Heuristics, 2019
Eng. Appl. Artif. Intell., 2019
A population algorithm based on randomized tabu thresholding for the multi-commodity pickup-and-delivery traveling salesman problem.
Comput. Oper. Res., 2019
2018
Adaptive tabu search with strategic oscillation for the bipartite boolean quadratic programming problem with partitioned variables.
Inf. Sci., 2018
Inf. Sci., 2018
A memetic algorithm for the Orienteering Problem with Mandatory Visits and Exclusionary Constraints.
Eur. J. Oper. Res., 2018
Eng. Appl. Artif. Intell., 2018
Multi-restart iterative search for the pickup and delivery traveling salesman problem with FIFO loading.
Comput. Oper. Res., 2018
A hybrid dynamic programming and memetic algorithm to the Traveling Salesman Problem with Hotel Selection.
Comput. Oper. Res., 2018
Appl. Soft Comput., 2018
2017
Eur. J. Oper. Res., 2017
Proceedings of the Genetic and Evolutionary Computation Conference, 2017
2016
J. Comb. Optim., 2016
A clique-based exact method for optimal winner determination in combinatorial auctions.
Inf. Sci., 2016
Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem.
Comput. Oper. Res., 2016
2015
Expert Syst. Appl., 2015
Appl. Soft Comput., 2015
2013
The maximum clique problems with applications to graph coloring. (Problèmes de clique maximum avec applications à la coloration de graphe).
PhD thesis, 2013
J. Comb. Optim., 2013
Eur. J. Oper. Res., 2013
Asia Pac. J. Oper. Res., 2013
2012
Discret. Appl. Math., 2012
Comput. Oper. Res., 2012
Ann. Oper. Res., 2012
Proceedings of the Parallel Problem Solving from Nature - PPSN XII, 2012