Narrow search
Showing 1 - 5 of 5
Cover Image
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
Cover Image
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
Cover Image
The application of nature-inspired optimization algorithms on the modern management : a systematic literature review and bibliometric analysis
Zhou, Yi; Xia, Weili; Dai, Jiapeng - In: Journal of management & organization : JMO 29 (2023) 4, pp. 655-678
Persistent link: https://www.econbiz.de/10014438083
Cover Image
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
Cover Image
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