Results 271 to 280 of about 1,486,783 (327)

The Probabilistic Set-Covering Problem

Operations Research, 2002
In 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

On the Set-Covering Problem

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

Solving hard set covering problems

Operations Research Letters, 1995
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
MANNINO, Carlo, SASSANO, Antonio
openaire   +3 more sources

Set Cover Problems with Small Neighborhood Covers

Theory of Computing Systems, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Agarwal, Archita   +4 more
openaire   +2 more sources

Enrichment set cover problem

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

Home - About - Disclaimer - Privacy