10 citations · 28 across the 9 of their papers we have counts for
5 papers · 1 filter
Iterated two-phase local search for the Set-Union Knapsack Problem
Zequn Wei, Jin-Kao Hao
The Set-union Knapsack Problem (SUKP) is a generalization of the popular 0-1 knapsack problem. Given a set of weighted elements and a set of items with profits where each item is c…
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…
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…
Reinforcement learning based local search for grouping problems: A case study on graph coloring
Yangming Zhou, Jin-Kao Hao, Béatrice Duval
Grouping problems aim to partition a set of items into multiple mutually disjoint subsets according to some specific criterion and constraints. Grouping problems cover a large clas…
On memetic search for the max-mean dispersion problem
Xiangjing Lai, Jin-Kao Hao
Given a set of elements and a distance matrix among elements, the max-mean dispersion problem (MaxMeanDP) consists in selecting a subset from …