Results 271 to 280 of about 925,039 (306)
Some of the next articles are maybe not open access.
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
Computing the minimal covering set
Mathematical Social Sciences, 2008zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Felix Brandt 0001, Felix A. Fischer
openaire +2 more sources
Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2015
The classic Set Cover problem requires selecting a minimum size subset A ⊆ F from a family of finite subsets F Of U such that the elements covered by A are the ones covered by F. It naturally occurs in many settings in web search, web mining and web advertising.
Stergios Stergiou +1 more
openaire +1 more source
The classic Set Cover problem requires selecting a minimum size subset A ⊆ F from a family of finite subsets F Of U such that the elements covered by A are the ones covered by F. It naturally occurs in many settings in web search, web mining and web advertising.
Stergios Stergiou +1 more
openaire +1 more source
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
Covering Numbers in Covering-Based Rough Sets
2011Rough set theory provides a systematic way for rule extraction, attribute reduction and knowledge classification in information systems. Some measurements are important in rough sets. For example, information entropy, knowledge dependency are useful in attribute reduction algorithms.
Shiping Wang +2 more
openaire +1 more source