Similar Search Results

Narrow search

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

Stagnation-aware breakout tabu search for the minimum conductance graph partitioning problem

Lu, Zhi; Hao, Jin-Kao; Zhou, Yi - In: Computers & operations research : and their … 111 (2019), pp. 43-57

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

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