collaborators

1 paper

cs.DS2022

Efficient and Effective Local Search for the Set-Union Knapsack Problem and Budgeted Maximum Coverage Problem

Wenli Zhu, Liangqing Luo

The Set-Union Knapsack Problem (SUKP) and Budgeted Maximum Coverage Problem (BMCP) are two closely related variant problems of the popular knapsack problem. Given a set of weighted…