Search Results - person:"Fu, Zhang-Hua"

A Partition-and-Merge Algorithm for Solving the Steiner Tree Problem in Large Graphs

Wu, Xinyu; Zhou, Yi; Hao, Jin-Kao; Fu, Zhang-Hua - 2023

The Steiner tree problem aims to determine a minimum edge-weighted tree spanning a given set of terminal vertices from a given graph. As a popular model for numerous practical applications, the problem has been the object of two important competitions (the 11th DIMACS Challenge in 2014 and the...

Persistent link: https://www.econbiz.de/10014259946

An effective hybrid search algorithm for the multiple traveling repairman problem with profits

Ren, Jintong; Hao, Jin-Kao; Wu, Feng; Fu, Zhang-Hua - In: European journal of operational research : EJOR 304 (2023) 2, pp. 381-394

Persistent link: https://www.econbiz.de/10013534526

Iterated dynamic thresholding search for packing equal circles into a circular container

Lai, Xiangjing; Hao, Jin-Kao; Yue, Dong; Lü, Zhipeng; … - In: European journal of operational research : EJOR 299 (2022) 1, pp. 137-153

Persistent link: https://www.econbiz.de/10013206987

Neighborhood decomposition based variable neighborhood search and tabu search for maximally diverse grouping

Lai, Xiangjing; Hao, Jin-Kao; Fu, Zhang-Hua; Yue, Dong - In: European journal of operational research : EJOR 289 (2021) 3, pp. 1067-1086

Persistent link: https://www.econbiz.de/10012433605

Neighborhood decomposition-driven variable neighborhood search for capacitated clustering

Lai, Xiangjing; Hao, Jin-Kao; Fu, Zhang-Hua; Yue, Dong - In: Computers & operations research : and their … 134 (2021), pp. 1-17

Persistent link: https://www.econbiz.de/10012649665

Dynamic programming driven memetic search for the Steiner tree problem with revenues, budget, and hop constraints

Fu, Zhang-Hua; Hao, Jin-Kao - In: INFORMS journal on computing : JOC 27 (2015) 2, pp. 221-237

Persistent link: https://www.econbiz.de/10011291334

Breakout local search for the Steiner tree problem with revenue, budget and hop constraints

Fu, Zhang-Hua; Hao, Jin-Kao - In: European Journal of Operational Research 232 (2014) 1, pp. 209-220

The Steiner tree problem (STP) is one of the most popular combinatorial optimization problems with various practical applications. In this paper, we propose a Breakout Local Search (BLS) algorithm for an important generalization of the STP: the Steiner tree problem with revenue, budget and hop...

Persistent link: https://www.econbiz.de/10010738137

Breakout local search for the Steiner tree problem with revenue, budget and hop constraints

Fu, Zhang-hua; Hao, Jin-Kao - In: European journal of operational research : EJOR 232 (2014) 1, pp. 209-220

Persistent link: https://www.econbiz.de/10010224716