most citedProbability Learning based Tabu Search for the Budgeted Maximum Coverage Problem

2 citations · 2 across the 1 of their papers we have counts for

collaborators

1 paper

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…