activity
20192021
most citedIterated two-phase local search for the Set-Union Knapsack Problem

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

collaborators
Showing 2020Show all

1 paper · 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…