Similar Search Results

An effective branch-and-bound algorithm for the maximum s-bundle problem

Zhou, Yi; Lin, Weibo; Hao, Jin-Kao; Xiao, Mingyu; Jin, Yan - In: European journal of operational research : EJOR 297 (2022) 1, pp. 27-39

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

Finding small feedback arc sets on large graphs

Xiong, Ziliang; Zhou, Yi; Xiao, Mingyu; Khoussainov, … - In: Computers & operations research : an international journal 169 (2024), pp. 1-15

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

Computing maximum k-defective cliques in massive graphs

Chen, Xiaoyu; Zhou, Yi; Hao, Jin-Kao; Xiao, Mingyu - In: Computers & operations research : and their … 127 (2021), pp. 1-18

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

Towards effective exact methods for the Maximum Balanced Biclique Problem in bipartite graphs

Zhou, Yi; Rossi, André; Hao, Jin-Kao - In: European journal of operational research : EJOR 269 (2018) 3, pp. 834-843

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

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

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