Results 291 to 300 of about 1,486,783 (327)
Some of the next articles are maybe not open access.
Reoptimization of set covering problems
Cybernetics and Systems Analysis, 2010zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
A Heuristic Method for the Set Covering Problem
Operations Research, 1999We present a Lagrangian-based heuristic for the well-known Set Covering Problem (SCP). The algorithm was initially designed for solving very large scale SCP instances, involving up to 5,000 rows and 1,000,000 columns, arising from crew scheduling in the Italian Railway Company, Ferrovie dello Stato SpA.
Caprara A., Fischetti M., Toth P.
openaire +4 more sources
Cultural Algorithms for the Set Covering Problem
2013This paper addresses the solution of weighted set covering problems using cultural algorithms. The weighted set covering problem is a reasonably well known NP-complete optimization problem with many real world applications. We use a cultural evolutionary architecture to maintain knowledge of diversity and fitness learned over each generation during the
Crawford, Broderick +2 more
openaire +2 more sources
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
A Note on the Set Covering Problem
Journal of the Operational Research Society, 1982A previously published work on a ‘probabilistic’ formulation of the set covering problem is discussed. Attention is drawn to the dependence of the feasible locations of facilities on the way the continuous space of incidents is divided into subregions when using either the above formulation or the standard deterministic formulation of the set covering ...
openaire +1 more source
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
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
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
Navigating financial toxicity in patients with cancer: A multidisciplinary management approach
Ca-A Cancer Journal for Clinicians, 2022Grace Li Smith +2 more
exaly