Qinghua Wu

Orcid: 0000-0003-4015-0305

Affiliations:
  • 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 65 papers between 2012 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A hybrid genetic algorithm for the Hamiltonian <i>p</i>-median problem.
Networks, March, 2024

An effective hybrid evolutionary algorithm for the clustered orienteering problem.
Eur. J. Oper. Res., March, 2024

An effective hybrid evolutionary algorithm for the set orienteering problem.
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

2023
Hybrid genetic algorithm for undirected traveling salesman problems with profits.
Networks, October, 2023

Learning-based multi-start iterated local search for the profit maximization set covering problem.
Inf. Sci., October, 2023

Breakout local search for the traveling salesman problem with job-times.
Expert Syst. Appl., September, 2023

A parallel adaptive memory algorithm for the capacitated modular hub location problem.
Comput. Oper. Res., May, 2023

Dynamic thresholding search for the feedback vertex set problem.
PeerJ Comput. Sci., 2023

2022
Solving the clustered traveling salesman problem <i>via</i> traveling salesman problem methods.
PeerJ Comput. Sci., 2022

An adaptive memetic algorithm for the bidirectional loop layout problem.
Knowl. Based Syst., 2022

Breakout local search for the cyclic cutwidth minimization problem.
J. Heuristics, 2022

A memetic algorithm based on edge-state learning for max-cut.
Expert Syst. Appl., 2022

A hybrid evolutionary search for the generalized quadratic multiple knapsack problem.
Eur. J. Oper. Res., 2022

Learning-driven feasible and infeasible tabu search for airport gate assignment.
Eur. J. Oper. Res., 2022

Reinforcement learning based tabu search for the minimum load coloring problem.
Comput. Oper. Res., 2022

A hybrid evolutionary algorithm for the capacitated minimum spanning tree problem.
Comput. Oper. Res., 2022

2021
Responsive threshold search based memetic algorithm for balanced minimum sum-of-squares clustering.
Inf. Sci., 2021

Solving maximum quasi-clique problem by a hybrid artificial bee colony approach.
Inf. Sci., 2021

A highly effective hybrid evolutionary algorithm for the covering salesman problem.
Inf. Sci., 2021

Grouping memetic search for the colored traveling salesmen problem.
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
Memetic search for the equitable coloring problem.
Knowl. Based Syst., 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

A hybrid evolutionary algorithm for finding low conductance of large graphs.
Future Gener. Comput. Syst., 2020

An opposition-based memetic algorithm for the maximum quasi-clique problem.
Eur. J. Oper. Res., 2020

An effective memetic algorithm for the generalized bike-sharing rebalancing problem.
Eng. Appl. Artif. Intell., 2020

Solving the Clustered Traveling Salesman Problem via TSP methods.
CoRR, 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

An exact algorithm for the multi-period inspector scheduling problem.
Comput. Ind. Eng., 2020

Memetic search for composing medical crews with equity and efficiency.
Appl. Soft Comput., 2020

2019
Hybrid evolutionary search for the traveling repairman problem with profits.
Inf. Sci., 2019

An effective multi-wave algorithm for solving the max-mean dispersion problem.
J. Heuristics, 2019

Heuristic search to the capacitated clustering problem.
Eur. J. Oper. Res., 2019

Memetic algorithm for the multiple traveling repairman problem with profits.
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

Adaptive feasible and infeasible tabu search for weighted vertex coloring.
Inf. Sci., 2018

A memetic algorithm for the Orienteering Problem with Mandatory Visits and Exclusionary Constraints.
Eur. J. Oper. Res., 2018

Tabu search with feasible and infeasible searches for equitable coloring.
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

Minimum sum coloring for large graphs with extraction and backward expansion search.
Appl. Soft Comput., 2018

2017
Effective metaheuristic algorithms for the minimum differential dispersion problem.
Eur. J. Oper. Res., 2017

On feasible and infeasible search for equitable graph coloring.
Proceedings of the Genetic and Evolutionary Computation Conference, 2017

2016
Solving the maximum vertex weight clique problem via binary quadratic programming.
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
Solving the winner determination problem via a weighted maximum clique heuristic.
Expert Syst. Appl., 2015

A review on algorithms for maximum clique problems.
Eur. J. Oper. Res., 2015

A tabu search based hybrid evolutionary algorithm for the max-cut problem.
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

An adaptive multistart tabu search approach to solve the maximum clique problem.
J. Comb. Optim., 2013

A hybrid metaheuristic method for the Maximum Diversity Problem.
Eur. J. Oper. Res., 2013

Improved Lower Bounds for Sum Coloring via Clique Decomposition
CoRR, 2013

Memetic search for the max-bisection problem.
Comput. Oper. Res., 2013

An Extraction and Expansion Approach for Graph Coloring.
Asia Pac. J. Oper. Res., 2013

2012
Improving the extraction and expansion method for large graph coloring.
Discret. Appl. Math., 2012

An effective heuristic algorithm for sum coloring of graphs.
Comput. Oper. Res., 2012

Coloring large graphs based on independent set extraction.
Comput. Oper. Res., 2012

Multi-neighborhood tabu search for the maximum weight clique problem.
Ann. Oper. Res., 2012

A Memetic Approach for the Max-Cut Problem.
Proceedings of the Parallel Problem Solving from Nature - PPSN XII, 2012


  Loading...