895 search results - page 3 / 179 » An Indirect Genetic Algorithm for Set Covering Problems |
ANTSW
2004
Springer
14 years 23 days ago
2004
Springer
Abstract. In this paper we present a study of several Ant Colony Optimization (ACO) algorithms for the Set Covering Problem. In our computational study we emphasize the influence ...
ESA
2005
Springer
14 years 26 days ago
2005
Springer
The input to the minimum latency set cover problem (MLSC) consists of a set of jobs and a set of tools. Each job j needs a specific subset Sj of the tools in order to be processed...
CSC
2008
13 years 8 months ago
2008
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
COCOON
2010
Springer
13 years 11 months ago
2010
Springer
IPL
2008
13 years 7 months ago
2008
The Positive-Negative Partial Set Cover problem is introduced and its complexity, especially the hardness-of-approximation, is studied. The problem generalizes the Set Cover probl...