Results 111 to 120 of about 149,933 (163)
Some of the next articles are maybe not open access.
A Greedy Heuristic for the Set-Covering Problem
Mathematics of Operations Research, 1979Let A be a binary matrix of size m × n, let cT be a positive row vector of length n and let e be the column vector, all of whose m components are ones. The set-covering problem is to minimize cTx subject to Ax ≥ e and x binary. We compare the value of the objective function at a feasible solution found by a simple greedy heuristic to the true optimum.
V Chvatal
exaly +2 more sources
Operations Research, 1972
This paper establishes some useful properties of the equality-constrained set-covering problem P and the associated linear program P′. First, the Dantzig property of transportation matrices is shown to hold for a more general class of matrices arising in connection with adjacent integer solutions to P′.
Egon Balas, Manfred W. Padberg
openaire +2 more sources
This paper establishes some useful properties of the equality-constrained set-covering problem P and the associated linear program P′. First, the Dantzig property of transportation matrices is shown to hold for a more general class of matrices arising in connection with adjacent integer solutions to P′.
Egon Balas, Manfred W. Padberg
openaire +2 more sources
The Probabilistic Set-Covering Problem
Operations Research, 2002In a probabilistic set-covering problem the right-hand side is a random binary vector and the covering constraint has to be satisfied with some prescribed probability. We analyze the structure of the set of probabilistically efficient points of binary random vectors, develop methods for their enumeration, and propose specialized branch-and-bound ...
BERALDI, Patrizia, RUSZCZYNSKI A.
openaire +3 more sources
Algorithms for the Set Covering Problem
Annals of Operations Research, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
CAPRARA A., TOTH P., FISCHETTI, MATTEO
openaire +2 more sources
Set Cover Problems with Small Neighborhood Covers
Theory of Computing Systems, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Archita Agarwal +4 more
openaire +2 more sources
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
On Capacitated Set Cover Problems
2011Recently, Chakrabarty et al. [5] initiated a systematic study of capacitated set cover problems, and considered the question of how their approximability relates to that of the uncapacitated problem on the same underlying set system. Here, we investigate this connection further and give several results, both positive and negative.
Bansal, N., Krishnaswamy, R., Saha, B.
openaire +2 more sources
Requiring Connectivity in the Set Covering Problem
Journal of Combinatorial Optimization, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
J. Orestes Cerdeira +1 more
openaire +2 more sources