Results 1 to 10 of about 149,933 (163)
The Angular Set Covering Problem
IEEE Access, 2023 We present an innovative extension of the Set Covering Problem, transitioning from a traditional radial covering to an angular covering structure. The decisions are based on locating the facilities and identifying the directional servers installed in ...
Fredy Barriga-Gallegos +2 more
doaj +2 more sources
Multi-objective database queries in combined knapsack and set covering problem domains. [PDF]
J Big Data, 2021 Database queries are one of the most important functions of a relational database. Users are interested in viewing a variety of data representations, and this may vary based on database purpose and the nature of the stored data.
Mochocki SA +3 more
europepmc +2 more sources
Application of the artificial bee colony algorithm for solving the set covering problem. [PDF]
ScientificWorldJournal, 2014 The set covering problem is a formal model for many practical optimization problems. In the set covering problem the goal is to choose a subset of the columns of minimal cost that covers every row.
Crawford B, Soto R, Cuesta R, Paredes F.
europepmc +2 more sources
A Novel Binary Dream Optimization Algorithm with Data-Driven Repair for the Set Covering Problem. [PDF]
Biomimetics (Basel)The Set Covering Problem is a fundamental NP-hard problem in combinatorial optimization and plays a central role in a wide range of industrial decision-making processes, including logistics planning, scheduling, facility location, network design, and ...
Crawford B +9 more
europepmc +2 more sources
Solving a fuzzy set-covering problem
Mathematical and Computer Modelling, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ming-Jiu Hwang
exaly +3 more sources
A Surprisal-Based Greedy Heuristic for the Set Covering Problem
Algorithms, 2023 In this paper we exploit concepts from Information Theory to improve the classical Chvatal greedy algorithm for the set covering problem. In particular, we develop a new greedy procedure, called Surprisal-Based Greedy Heuristic (SBH), incorporating the ...
Tommaso Adamo +3 more
doaj +1 more source
The online set cover problem [PDF]
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, 2003 Let $X=\{1,2,\ldots,n\}$ be a ground set of $n$ elements, and let ${\cal S}$ be a family of subsets of $X$, $|{\cal S}|=m$, with a positive cost $c_S$ associated with each $S\in{\cal S}$. Consider the following online version of the set cover problem, described as a game between an algorithm and an adversary.
Noga Alon +4 more
openaire +2 more sources
Set Covering Problem in Transport Nets Expanding Models [PDF]
Transactions of the VŠB-Technical University of Ostrava, Mechanical Series, 2012 The article deals with the problem of optimal coverage of utility centres in transport network. We can often encounter similar types of tasks in a real life.
Dušan TEICHMANN +2 more
doaj +1 more source
Ant-Set: A Subset-Oriented Ant Colony Optimization Algorithm for the Set Covering Problem [PDF]
Journal of Universal Computer Science, 2020 This paper proposes an algorithm for the set covering problem based on the metaheuristic Ant Colony Optimization (ACO) called Ant-Set, which uses a lineoriented approach and a novelty pheromone manipulation based on the connections between components of ...
Murilo Falleiros Lemos Schmitt +4 more
doaj +3 more sources
Applied Sciences, 2020 This paper presents an extension of the covering location problem as a hybrid covering model that utilizes the set covering and maximal covering location problems. The developed model is a multi-period model that considers strategic and tactical planning
Roghayyeh Alizadeh, Tatsushi Nishi
doaj +1 more source