42 citations · 123 across the 21 of their papers we have counts for
5 papers · 1 filter
When data mining meets optimization: A case study on the quadratic assignment problem
Yangming Zhou, Jin-Kao Hao, Béatrice Duval
This paper presents a hybrid approach called frequent pattern based search that combines data mining and optimization. The proposed method uses a data mining procedure to mine freq…
Combining tabu search and graph reduction to solve the maximum balanced biclique problem
Yi Zhou, Jin-Kao Hao
The Maximum Balanced Biclique Problem is a well-known graph model with relevant applications in diverse domains. This paper introduces a novel algorithm, which combines an effectiv…
Towards Effective Exact Algorithms for the Maximum Balanced Biclique Problem
Yi Zhou, André Rossi, Jin-Kao Hao
The Maximum Balanced Biclique Problem (MBBP) is a prominent model with numerous applications. Yet, the problem is NP-hard and thus computationally challenging. We propose novel ide…
Memetic search for identifying critical nodes in sparse graphs
Yangming Zhou, Jin-Kao Hao, Fred Glover
Critical node problems involve identifying a subset of critical nodes from an undirected graph whose removal results in optimizing a pre-defined measure over the residual graph. As…
Diversification-Based Learning in Computing and Optimization
Fred Glover, Jin-Kao Hao
Diversification-Based Learning (DBL) derives from a collection of principles and methods introduced in the field of metaheuristics that have broad applications in computing and opt…