895 search results - page 4 / 179 » An Indirect Genetic Algorithm for Set Covering Problems |
STOC
2003
ACM
14 years 7 months ago
2003
ACM
AAIM
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. We study an extension of the set cover problem, the connected set cover problem, the problem is to find a set cover of minimal size that satisfies some connectivity con...
GECCO
2004
Springer
14 years 22 days ago
2004
Springer
Abstract. When direct measurement of model parameters is not possible, these need to be inferred indirectly from calibration data. To solve this inverse problem, an algorithm that ...
APPROX
2000
Springer
13 years 11 months ago
2000
Springer
Given a graph (directed or undirected) with costs on the edges, and an integer k, we consider the problem of nding a k-node connected spanning subgraph of minimum cost. For the ge...
WALCOM
2010
IEEE
14 years 2 months ago
2010
IEEE
We address a version of the set-cover problem where we do not know the sets initially (and hence referred to as covert) but we can query an element to find out which sets contain ...