Results 251 to 260 of about 536,987 (307)

Optimizing sleep scheduling in wireless sensor networks via node utility and critical target prioritization. [PDF]

Sci Rep
Wu J, Tian S, Qi X, Cai Z, Wang P.
europepmc   +1 more source

Network methods for diagonal integration of unpaired single-cell multiomics data: a review. [PDF]

Bioinformatics
Barylli M, Saha J, Buffart TE, Koster J, Lenos KJ, Vermeulen L, Bumbuc RV, Sheraton VM.   +7 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

A Greedy Heuristic for the Set-Covering Problem

Mathematics of Operations Research, 1979
Let 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

Cultural Algorithms for the Set Covering Problem

, 2013
This paper addresses the solution of weighted set covering problems using cultural algorithms. The weighted set covering problem is a reasonably well known NP-complete optimization problem with many real world applications. We use a cultural evolutionary architecture to maintain knowledge of diversity and fitness learned over each generation during the
Broderick Crawford, Ricardo Soto 0001, Éric Monfroy   +2 more
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′.
Egon Balas, Manfred W. Padberg
openaire   +2 more sources

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