Results 41 to 50 of about 1,485,911 (189)
The Pipelined Set Cover Problem [PDF]
, 2004 A classical problem in query optimization is to find the optimal ordering of a set of possibly correlated selections. We provide an abstraction of this problem as a generalization of set cover called pipelined set cover, where the sets are applied sequentially to the elements to be covered and the elements covered at each stage are discarded.
Kamesh Munagala +3 more
openaire +1 more source
Binary Secretary Bird Optimization Algorithm for the Set Covering Problem
MathematicsThe Set Coverage Problem (SCP) is an important combinatorial optimization problem known to be NP-complete. The use of metaheuristics to solve the SCP includes different algorithms.
Broderick Crawford +7 more
doaj +1 more source
Design and Optimization of Underground Logistics Transportation Networks
IEEE Access, 2019 With the burden of city transportation system becoming bigger and bigger, it is imperative to develop reliable and efficient underground logistics. The appropriate location of cargo transshipment centers in underground logistics system is selected using ...
Mu Ren +4 more
doaj +1 more source
On some covering problems in geometry [PDF]
, 2015 We present a method to obtain upper bounds on covering numbers. As applications of this method, we reprove and generalize results of Rogers on economically covering Euclidean $n$-space with translates of a convex body, or more generally, any measurable ...
Naszódi, Márton
core +4 more sources
On Mathematical Modelling of Automated Coverage Optimization in Wireless 5G and beyond Deployments
Applied Sciences, 2020 The need to optimize the deployment and maintenance costs for service delivery in wireless networks is an essential task for each service provider. The goal of this paper was to optimize the number of service centres (gNodeB) to cover selected customer ...
Pavel Seda, Milos Seda, Jiri Hosek
doaj +1 more source
Utilizing Heuristics and Metaheuristics for Solving the Set Covering Problem
U.Porto Journal of EngineeringA basic combinatorial optimization problem, the Set Covering Problem (SCP) finds extensive use in computer science, operations research, and logistics, among other domains.
Lourenço Sousa de Pinho
doaj +1 more source
About a certain NP complete problem
, 2020 In this article we introduce the concept of special decomposition of a set and the concept of special covering of a set under such a decomposition. We study the conditions for existence of special coverings of the sets, under the special decomposition of
Margaryan, Stepan
core
On the Optimality of a Class of LP-based Algorithms [PDF]
, 2009 In this paper we will be concerned with a class of packing and covering problems which includes Vertex Cover and Independent Set. Typically, one can write an LP relaxation and then round the solution.
Kumar, Amit +3 more
core +2 more sources
A Novel Approach to Combinatorial Problems: Binary Growth Optimizer Algorithm
BiomimeticsThe set-covering problem aims to find the smallest possible set of subsets that cover all the elements of a larger set. The difficulty of solving the set-covering problem increases as the number of elements and sets grows, making it a complex problem for
Dante Leiva +4 more
doaj +1 more source
Journal of Mathematics, 2021 Multigranulation rough set theory is an important tool to deal with the problem of multicriteria information system. The notion of fuzzy β-neighborhood has been used to construct some covering-based multigranulation fuzzy rough set (CMFRS) models through
Zaibin Chang, Lingling Mao
doaj +1 more source