Results 1 to 10 of about 1,486,225 (170)
Chemical reaction optimization for the set covering problem [PDF]
, 2014 The set covering problem (SCP) is one of the representative combinatorial optimization problems, having many practical applications. This paper investigates the development of an algorithm to solve SCP by employing chemical reaction optimization (CRO), a
Lam, AYS, Li, VOK, Yu, JJQ
core +3 more sources
An indirect genetic algorithm for set covering problems [PDF]
Journal of the Operational Research Society, 2002 This paper presents a new type of genetic algorithm for the set covering problem. It differs from previous evolutionary approaches first because it is an indirect algorithm, i.e. the actual solutions are found by an external decoder function. The genetic algorithm itself provides this decoder with permutations of the solution variables and other ...
Uwe Aickelin
openaire +8 more sources
Multi-objective database queries in combined knapsack and set covering problem domains. [PDF]
J Big Data, 2021 Mochocki SA +3 more
europepmc +3 more sources
The online set cover problem [PDF]
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, 2003 Let X=[1,2,•••,n] be a ground set of n elements, and let S be a family of subsets of X, |S|=m, with a positive cost cS associated with each S ∈ S.Consider the following online version of the set cover problem, described as a game between an algorithm and an adversary. An adversary gives elements to the algorithm from X one-by-one. Once a new element is
Noga Alon, Baruch Awerbuch, Yossi Azar
openaire +3 more sources
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 each, covering a set of points in a geographic area.
Fredy Barriga-Gallegos +2 more
openaire +2 more sources
Approximation Algorithms for Union and Intersection Covering Problems [PDF]
, 2011 In a classical covering problem, we are given a set of requests that we need to satisfy (fully or partially), by buying a subset of items at minimum cost. For example, in the k-MST problem we want to find the cheapest tree spanning at least k nodes of an
Cygan, Marek +5 more
core +5 more sources
On Asymmetric Coverings and Covering Numbers [PDF]
, 2002 An asymmetric covering D(n,R) is a collection of special subsets S of an n-set such that every subset T of the n-set is contained in at least one special S with |S| - |T|
Applegate, David +2 more
core +5 more sources
Unsplittable coverings in the plane [PDF]
, 2015 A system of sets forms an {\em $m$-fold covering} of a set $X$ if every point of $X$ belongs to at least $m$ of its members. A $1$-fold covering is called a {\em covering}.
A Asinowski +28 more
core +4 more sources
The minimum-entropy set cover problem
Theoretical Computer Science, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Halperin, Eran, Karp, Richard M.
openaire +2 more sources
On Polynomial Kernels for Integer Linear Programs: Covering, Packing and Feasibility [PDF]
, 2013 We study the existence of polynomial kernels for the problem of deciding feasibility of integer linear programs (ILPs), and for finding good solutions for covering and packing ILPs. Our main results are as follows: First, we show that the ILP Feasibility
Kratsch, Stefan
core +1 more source