Results 81 to 90 of about 2,347,375 (169)

Efficiency comparison of exact and approximate algorithms for solving set covering problem

Advanced Engineering Research, 2017
Introduction. A quite general class of practical tasks is guided by the set covering problem: schedules building, layout of service stations, and creation of electronic circuits.
Igor S. Konovalov, Sergey S. Ostapenko, Valery G. Kobak   +2 more
doaj   +1 more source

Application of Set Covering Location Problem for Organizing the Public Postal Network

Promet (Zagreb), 2016
Most countries of the European Union ensure certain obligations (criteria) which universal service providers must meet to ensure the realization of the universal service.
Dragana Šarac, Miloš Kopić, Katarina Mostarac, Momčilo Kujačić, Bojan Jovanović   +4 more
doaj   +1 more source

A Novel Approach to Combinatorial Problems: Binary Growth Optimizer Algorithm

Biomimetics
The 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, Benjamín Ramos-Tapia, Broderick Crawford, Ricardo Soto, Felipe Cisternas-Caneo   +4 more
doaj   +1 more source

Study on Interval-valued Dual Hesitant Fuzzy β Covering Rough Set Model

Journal of Harbin University of Science and Technology
To effectively handle the problem of decision-making with interval-valued hesitant fuzzy information, this paper proposes four models of interval-valued dual hesitant fuzzy β coverage rough sets,which are combined with interval-valued dual hesitant fuzzy
REN Haowei, WANG Qinghai
doaj   +1 more source

Binary Chaotic White Shark Optimizer for the Unicost Set Covering Problem

Mathematics
The 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, Broderick Crawford, Felipe Cisternas-Caneo, Eduardo Rodriguez-Tello, Ricardo Soto, José Barrera-Garcia, Fernando Lepe-Silva   +6 more
doaj   +1 more source

Mathematical model for determining optimal operating conditions of the remote energy supply complex for spatially distributed groups of aerial objects

Известия высших учебных заведений. Поволжский регион:Технические науки
Background. The object of the research is a remote energy supply complex (RESC) for spatially distributed groups of aerial objects. The subject of the research is the operational parameters of RESC and their impact on the efficiency of energy supply. The
A.A. Chepiga
doaj   +1 more source

On Covering Approximation Subspaces [PDF]

Computer Science Journal of Moldova, 2009
Let (U';C') be a subspace of a covering approximation space (U;C) and X⊂U'. In this paper, we show that and B'(X)⊂B(X)∩U'. Also, iff (U;C) has Property Multiplication. Furthermore, some connections between outer (resp. inner) definable subsets in (U;C)
Xun Ge
doaj  

Uncovered Sets [PDF]

This paper covers the theory of the uncovered set used in the literatures on tournaments and spatial voting. I discern three main extant definitions, and I introduce two new concepts that bound exist- ing sets from above and below: the deep uncovered set
John Duggan
core  

Model and algorithm for forming spatially distributed groups of aerial objects to optimize their energy supply

Известия высших учебных заведений. Поволжский регион:Технические науки
Background. The object of the research is the energy supply system for spatially distributed groups of aerial objects. The subject of the research is algorithms for forming optimal clusters for simultaneous energy transmission to multiple unmanned aerial
A.A. Chepiga
doaj   +1 more source

Covering sets by subsets

Monatshefte f�r Mathematik, 1984
Let to every element x of a finite set M be associated some nonempty subset M(x) of M in such a way that the implication \(y\in M(x)\Rightarrow x\in M(y)\) is fulfilled. We prove two upper estimations for the least number of sets M(x) which are necessary to cover M. Several applications to number theory are presented.
openaire   +1 more source