Results 41 to 50 of about 149,933 (163)
Approximation of the Clustered Set Covering Problem [PDF]
Electronic Notes in Discrete Mathematics, 2010 Abstract We define a NP-hard clustered variant of the Set Covering Problem where subsets are partitioned into K clusters and a fixed cost is paid for selecting at least one subset in a given cluster. This variant can reformulate as a master problem various multi-commodity flow problems in transportation planning.
Laurent Alfandari, Jérôme Monnot
openaire +1 more source
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
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
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
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
A Local Branching Approach for the Set Covering Problem
International Journal of Industrial Engineering and Production Research, 2014 The set covering problem (SCP) is a well-known combinatorial optimization problem. This paper investigates development of a local branching approach for the SCP.
Masoud Yaghini +2 more
doaj
Binary Chaotic White Shark Optimizer for the Unicost Set Covering Problem
MathematicsThe Unicost Set Covering Problem (USCP), an NP-hard combinatorial optimization challenge, demands efficient methods to minimize the number of sets covering a universe.
Pablo Zúñiga-Valenzuela +6 more
doaj +1 more source
Algorithms for connected set cover problem and fault-tolerant connected set cover problem
Theoretical Computer Science, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhao Zhang 0002 +2 more
openaire +1 more source
Theoretical Computer Science, 2011 6 pages, 1 figure, submitted to Theoretical Computer ...
Wei Ren, Qing Zhao
openaire +3 more sources
Exact solutions for the 2d-strip packing problem using the positions-and-covering methodology.
PLoS ONE, 2021 We use the Positions and Covering methodology to obtain exact solutions for the two-dimensional, non-guillotine restricted, strip packing problem. In this classical NP-hard problem, a given set of rectangular items has to be packed into a strip of fixed ...
Nestor M Cid-Garcia, Yasmin A Rios-Solis
doaj +1 more source