Narrow search
Showing 1 - 7 of 7
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
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
Cover Image
A vertex-separator-based integer linear programming formulation for the partitioned Steiner tree problem
Ma, Mengfan; Men, Ziyang; Rossi, André; Zhou, Yi; … - In: Computers & operations research : and their … 153 (2023), pp. 1-15
Persistent link: https://www.econbiz.de/10014265845
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 note on inexact gradient and Hessian conditions for cubic regularized Newton’s method
Wang, Zhe; Zhou, Yi; Liang, Yingbin; Lan, Guanghui - In: Operations research letters 47 (2019) 2, pp. 146-149
Persistent link: https://www.econbiz.de/10012003282
Cover Image
PUSH : a generalized operator for the maximum vertex weight clique problem
Zhou, Yi; Hao, Jin-Kao; Goëffon, Adrien - In: European journal of operational research : EJOR 257 (2017) 1, pp. 41-54
Persistent link: https://www.econbiz.de/10011639334
Cover Image
Frequency-driven tabu search for the maximum s-plex problem
Zhou, Yi; Hao, Jin-Kao - In: Computers & operations research : and their … 86 (2017), pp. 65-78
Persistent link: https://www.econbiz.de/10011732201