2 citations · 6 across the 3 of their papers we have counts for
Showing cs.AIShow all
2 papers · 1 filter
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…
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…