2 citations · 4 across the 3 of their papers we have counts for
3 papers
cs.LG2022
On Monte Carlo Tree Search for Weighted Vertex Coloring
Cyril Grelier, Olivier Goudet, Jin-Kao Hao
This work presents the first study of using the popular Monte Carlo Tree Search (MCTS) method combined with dedicated heuristics for solving the Weighted Vertex Coloring Problem. S…
cs.NE2021★ 2 cited
A threshold search based memetic algorithm for the disjunctively constrained knapsack problem
Zequn Wei, Jin-Kao Hao
The disjunctively constrained knapsack problem consists in packing a subset of pairwisely compatible items in a capacity-constrained knapsack such that the total profit of the sele…
cs.AI2020★ 2 cited
Probability Learning based Tabu Search for the Budgeted Maximum Coverage Problem
Liwen Li, Zequn Wei, Jin-Kao Hao +1
Knapsack problems are classic models that can formulate a wide range of applications. In this work, we deal with the Budgeted Maximum Coverage Problem (BMCP), which is a generalize…