Results 271 to 280 of about 504,784 (313)
Some of the next articles are maybe not open access.
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
Canadian Journal of Mathematics, 1980
The proof of a main result in [1] concerning (0,1)-endomorphisms of finite lattices is based on properties of lattices A(G) derived from the system of independent sets of an undirected loop-free graph G. For a number of questions naturally arising from [1] and [2], however, constructions employing only graph-induced complementation and properties of ...
Adams, M. E., Sichler, J.
openaire +2 more sources
The proof of a main result in [1] concerning (0,1)-endomorphisms of finite lattices is based on properties of lattices A(G) derived from the system of independent sets of an undirected loop-free graph G. For a number of questions naturally arising from [1] and [2], however, constructions employing only graph-induced complementation and properties of ...
Adams, M. E., Sichler, J.
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
Information Sciences, 1985
In the paper the least-cost set covering problem \[ LC: \min (c^ Tx\quad | \quad Ax\geq 1,\quad x_ j\in \{0,1\}) \] and its special case, the minimum covering problem \[ MC: \min (1^ Tx\quad | \quad Ax\geq 1,\quad x_ j\in \{0,1\}) \] are dealt with. In the problems above A is the incidence matrix, x is a binary vector to be determined and c is the cost
openaire +1 more source
In the paper the least-cost set covering problem \[ LC: \min (c^ Tx\quad | \quad Ax\geq 1,\quad x_ j\in \{0,1\}) \] and its special case, the minimum covering problem \[ MC: \min (1^ Tx\quad | \quad Ax\geq 1,\quad x_ j\in \{0,1\}) \] are dealt with. In the problems above A is the incidence matrix, x is a binary vector to be determined and c is the cost
openaire +1 more source
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
2007
This paper is devoted to the discussion of extended covering rough set models. Based on the notion of neighborhood, five pairs of dual covering approximation operators were defined with their properties being discussed. The relationships among these operators were investigated.
Keyun Qin, Yan Gao, Zheng Pei 0001
openaire +1 more source
This paper is devoted to the discussion of extended covering rough set models. Based on the notion of neighborhood, five pairs of dual covering approximation operators were defined with their properties being discussed. The relationships among these operators were investigated.
Keyun Qin, Yan Gao, Zheng Pei 0001
openaire +1 more source
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
On Set Covering Based on Biclustering
International Journal of Information Technology & Decision Making, 2014In this paper, we present a clustering heuristic for solving demand covering models where the objective is to determine locations for servers that optimally cover a given set of demand points. This heuristic is based on the concept of biclusters and processes the set of demand points as well as the set of potential servers and determines biclusters ...
Antiopi Panteli +2 more
openaire +2 more sources
Covering analytic sets by families of closed set
Journal of Symbolic Logic, 1994AbstractWe prove that for every familyIof closed subsets of a Polish space eachset can be covered by countably many members ofIor else contains a nonemptyset which cannot be covered by countably many members ofI. We prove an analogous result forκ-Souslin sets and show that ifA#exists for anyA⊂ωω, then the above result is true forsets.
openaire +2 more sources