Results 131 to 140 of about 149,933 (163)
Some of the next articles are maybe not open access.
Approximation Algorithms for the Set Covering and Vertex Cover Problems
SIAM Journal on Computing, 1982We propose a heuristic that delivers in $O(n^3 )$ steps a solution for the set covering problem the value of which does not exceed the maximum number of sets covering an element times the optimal value.
openaire +2 more sources
A Genetic Algorithm for the Set Covering Problem
Journal of the Operational Research Society, 1996Summary: The set covering problem (SCP) is considered. Several algorithms have been suggested in the literature for solving it. We propose a new algorithm for solving the SCP which is based on the genetic technique. This algorithm has been implemented and tested on various standard and randomly generated test problems.
Al-Sultan, K. S. +2 more
openaire +2 more sources
Unique Covering Problems with Geometric Sets
2015The Exact Cover problem takes a universe U of n elements, a family \(\mathcal F \) of m subsets of U and a positive integer k, and decides whether there exists a subfamily(set cover) \(\mathcal F '\) of size at most k such that each element is covered by exactly one set.
Pradeesha Ashok +3 more
openaire +1 more source
A heuristic algorithm for the set covering problem
1996We present a Lagrangian-based heuristic for the well-known Set Covering Problem (SCP). The main characteristics of the algorithm we propose are (1) a dynamic pricing scheme for the variables, akin to that used for solving large-scale LP's, to be coupled with subgradient optimization and greedy algorithms, and (2) the systematic use of column fixing to ...
Caprara A., Fischetti M., Toth P.
openaire +2 more sources
Approximation of a Geometric Set Covering Problem
2001We consider a special set covering problem. This problem is a generalization of finding a minimum clique cover in an interval graph. When formulated as an integer program, the 0-1 constraint matrix of this integer program can be partitioned into an interval matrix and a special 0-1 matrix with a single 1 per column.
Sofia Kovaleva, Frits C. R. Spieksma
openaire +1 more source
On approximation of the submodular set cover problem
Operations Research Letters, 1999zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
A Lagrangean Heuristic for Set Covering Problems
Naval Research Logistics, 1990The set covering problem (SCP) is the problem of covering the rows of a m row, n column, zero-one matrix by a subset of the columns at minimum cost.
openaire +1 more source
On The Set Representation and Set Covering Problems
1973Give a finite set Γ = {l, 2,..., n} and a class C = {c1, c2... cm} of nonempty subsets of Γ, a subset E⊂Γ is said to represent the class C if $$ E\; \cap \;{c_{{i\;}}} \ne \;\Phi $$ for all ci e C The minimum cardinality set representation problem for C is the problem of finding a minimum cardinality subset of Γ representing the class C.
openaire +1 more source
Orientational variable-length strip covering problem: A branch-and-price-based algorithm
European Journal of Operational Research, 2021Xiaoxuan Hu, Waiming Zhu, Bo An
exaly
An ambulance location problem for covering inherently rare and random road crashes
Computers and Industrial Engineering, 2021Seyed Sina Mohri, Hossein Haghshenas
exaly