Results 191 to 200 of about 24,103 (206)

Solving the Holed Space Budgeted Maximum Coverage Problem with a Discrete Selection Problem

Proceedings of the 21st International Conference on Informatics in Control, Automation and Robotics
Phillip Smith, Mohammad Zamani
openaire   +3 more sources

Maximum coverage problem with group budget constraints

Journal of Combinatorial Optimization, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Boaz Farbstein, Asaf Levin
openaire   +2 more sources

Maximum Coverage Problem with Group Budget Constraints and Applications

2004
We study a variant of the maximum coverage problem which we label the maximum coverage problem with group budget constraints (MCG). We are given a collection of sets \({\cal S} = \{S_1, S_2, \ldots, S_m\}\) where each set S i is a subset of a given ground set X.
Chandra Chekuri, Amit Kumar 0001
openaire   +1 more source

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

2023
Wenli Zhu, Liangqing Luo
openaire   +1 more source

A Tabu Search Algorithm Based on Population Search Framework for Solving Multi-Budget Maximum Coverage Problem

2023
Yawen Liu, Dazhi Pan
openaire   +1 more source

Online Budgeted Maximum Coverage

Algorithmica, 2021
Dror Rawitz, Adi Rosen
exaly  

Generalized budgeted submodular set function maximization

Information and Computation, 2021
Gianlorenzo D'Angelo, Gianpiero Monaco, Yllka Velaj   +2 more
exaly  

A multi-neighborhood tabu search for solving multi-budget maximum coverage problem

Applied Soft Computing
Yawen Liu, Dazhi Pan
openaire   +1 more source

Partial Vertex Cover and Budgeted Maximum Coverage in Bipartite Graphs

SIAM Journal on Discrete Mathematics, 2017
Vahan Mkrtchyan, Ojas Parekh, K Subramani   +2 more
exaly  

A Budgeted Maximum Coverage based mmWave Enabled 5G RSUs Placement in Urban Vehicular Networks

2021
Moyukh Laha, Raja Datta
exaly