42 citations · 123 across the 21 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
cs.NE2019★ 2 cited
Variable Population Memetic Search: A Case Study on the Critical Node Problem
Yangming Zhou, Jin-Kao Hao, Zhang-Hua Fu +2
Population-based memetic algorithms have been successfully applied to solve many difficult combinatorial problems. Often, a population of fixed size was used in such algorithms to…
cs.LG2019★ 2 cited
Population-based Gradient Descent Weight Learning for Graph Coloring Problems
Olivier Goudet, Béatrice Duval, Jin-Kao Hao
Graph coloring involves assigning colors to the vertices of a graph such that two vertices linked by an edge receive different colors. Graph coloring problems are general models th…
cs.AI2019★ 2 cited
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…