Results 21 to 30 of about 536,987 (307)
Application of genetic algorithm for the set-covering problem solution
The weighed and unweighted minimal set-cover problem, its applicability for the solution of the major optimization practical tasks, such as arrangement of service points, assignment of crews in transport, as well as the integrated-circuit and conveyer ...
Igor S. Konovalov +2 more
doaj +1 more source
Initialization and Local Search Methods Applied to the Set Covering Problem: A Systematic Mapping
The set covering problem (SCP) is a classical combinatorial optimization problem part of Karp's 21 NP-complete problems. Many real-world applications can be modeled as set covering problems (SCPs), such as locating emergency services, military planning,
Nelson-Enrique Quemá-Taimbud +2 more
doaj +1 more source
On the Partition Set Cover Problem
Several algorithms with an approximation guarantee of $O(\log n)$ are known for the Set Cover problem, where $n$ is the number of elements. We study a generalization of the Set Cover problem, called the Partition Set Cover problem. Here, the elements are partitioned into $r$ \emph{color classes}, and we are required to cover at least $k_t$ elements ...
Tanmay Inamdar 0002 +1 more
openaire +2 more sources
On the Advice Complexity of the Set Cover Problem [PDF]
Recently, a new approach to get a deeper understanding of online computation has been introduced: the study of the advice complexity of online problems. The idea is to measure the information that online algorithms need to be supplied with to compute high-quality solutions and to overcome the drawback of not knowing future input requests.
Dennis Komm +2 more
openaire +3 more sources
THE MODEL FOR DETERMINING LOCATION OF NAVAL BASE USING AHP METHOD AND SET COVERING PROBLEM [PDF]
Indonesia is a nation that has a lot of island with most of its territory (2/3) is the sea and the rest of it (1/3) island that consist of many islands, this kind of geographical condition insist Indonesian Government control and guaranty its sea ...
Purnomo J. +3 more
doaj +1 more source
This research aims to explain the intrinsic difficulty of Karp’s list of twenty-one problems through the use of empirical complexity measures based on the ellipsoidal width of the polyhedron generated by the constraints of the relaxed linear programming ...
Ivan Derpich, Juan Valencia, Mario Lopez
doaj +1 more source
The minimum-entropy set cover problem
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Eran Halperin, Richard M. Karp
openaire +2 more sources
An Indirect Genetic Algorithm for Set Covering Problems [PDF]
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
Aickelin, Uwe, Aickelin, U, Uwe Aickelin
core +1 more source
A note on the Clustered Set Covering Problem
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alfandari, Laurent, Monnot, Jérôme
openaire +1 more source
Allocating costs in set covering problems [PDF]
This paper deals with the problem of allocating costs in set covering situations. In particular, we focus on set covering situations where the optimal covering is given in advance. Thus, we take into account only the facilities that have to be opened and look for rules distributing their cost.
Gustavo Bergantiños +4 more
openaire +3 more sources

