Taoqing Zhou

According to our database, Taoqing Zhou authored at least 5 papers between 2016 and 2017.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of five.

2017

Greedy Randomized Adaptive Search Procedure with Path-Relinking for the Vertex p-Center Problem.

Ai-Hua Yin, Taoqing Zhou, Junwen Ding, Qing-Jie Zhao, Zhi-Peng Lv

J. Comput. Sci. Technol., 2017

A quality and distance guided hybrid algorithm for the vertex separator problem.

Junwen Ding, Zhipeng Lü, Taoqing Zhou, Liping Xu

Comput. Oper. Res., 2017

A Quality and Distance Guided Metaheuristic Algorithm for Vertex Separation Problem.

Junwen Ding, Taoqing Zhou, Zhipeng Lü, Yujin Yuan

IEEE Access, 2017

A Memetic Algorithm for the Linear Ordering Problem with Cumulative Costs.

Taoqing Zhou, Zhipeng Lü, Tao Ye, Kan Zhou

Proceedings of the Combinatorial Optimization and Applications, 2017

2016

Multi-start iterated tabu search for the minimum weight vertex cover problem.

Taoqing Zhou, Zhipeng Lü, Yang Wang, Junwen Ding, Bo Peng

J. Comb. Optim., 2016