Results 141 to 150 of about 1,485,911 (189)
Some of the next articles are maybe not open access.
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
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′.
Balas, Egon, Padberg, Manfred W.
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′.
Balas, Egon, Padberg, Manfred W.
openaire +2 more sources
Solving hard set covering problems
Operations Research Letters, 1995zbMATH Open Web Interface contents unavailable due to conflicting licenses.
MANNINO, Carlo, SASSANO, Antonio
openaire +3 more sources
12th International Symposium on Operations Research and its Applications in Engineering, Technology and Management (ISORA 2015), 2015
As a common task in the fields of bioinformatics, enrichment analysis aims to investigate the functional association between a gene list of interest which often derived from biological experiments, and specific gene sets in a large database. The core problem of enrichment analysis can be characterized as a two-objective optimization problem.
null Yinliang Liu +2 more
openaire +1 more source
As a common task in the fields of bioinformatics, enrichment analysis aims to investigate the functional association between a gene list of interest which often derived from biological experiments, and specific gene sets in a large database. The core problem of enrichment analysis can be characterized as a two-objective optimization problem.
null Yinliang Liu +2 more
openaire +1 more source
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
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
Probabilistic partial set covering problems
Naval Research Logistics, 1991Summary: We consider a situation in which a group of facilities need to be constructed in order to serve a given set of customers. However, the facilities cannot guarantee an absolute coverage to any of the customers. Hence, we formulate this problem as one of maximizing the total service reliability of the system subject to a budgetary constraint. For
Sherali, Hanif D. +2 more
openaire +2 more sources
International Journal of Mathematical Education in Science and Technology, 1981
The solution of the set covering problem provides an ideal illustration of tree searching techniques. In this paper a variant of the A∗ algorithm is used to efficiently search a tree to find a minimal cost cover. The paper provides an ideal case study for mathematical programmers.
openaire +1 more source
The solution of the set covering problem provides an ideal illustration of tree searching techniques. In this paper a variant of the A∗ algorithm is used to efficiently search a tree to find a minimal cost cover. The paper provides an ideal case study for mathematical programmers.
openaire +1 more source
A special class of set covering problems
Computational Optimization and Applications, 1996zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Emamy-K., M. Reza, Ramírez, A. I.
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.
Cerdeira, J. Orestes, Pinto, Leonor S.
openaire +2 more sources