Effective Variable Depth Local Search for the Budgeted Maximum Coverage Problem

Effective Variable Depth Local Search for the Budgeted Maximum Coverage Problem

We address the Budgeted Maximum Coverage Problem (BMCP), which is a natural and more practical extension of the standard 0–1 knapsack problem and the set cover problem. Given m elements with nonnegative weights, n subsets of elements with nonnegative costs, and a total budget, BMCP aims to select so...

Full description

Bibliographic Details
Main Authors: He, K. (Author), Zheng, J. (Author), Zhou, J. (Author)
Format: Article
Language:English
Published: Springer Science and Business Media B.V. 2022
Subjects:
0-1 knapsack problem
Budget control
Budgeted maximum coverage problem
Budgeted maximum coverage problems
Combinatorial optimization
Costs
Effective variables
Iterative methods
Local search
Local search (optimization)
Local search algorithm
Neighbor structures
Neighbour structure
Non negatives
Set cover problem
Set theory
Structural optimization
Variable depth
Variable depth local search
Online Access:View Fulltext in Publisher

Internet

View Fulltext in Publisher

Similar Items