895 search results - page 48 / 179 » An Indirect Genetic Algorithm for Set Covering Problems |
IPPS
2006
IEEE
15 years 4 months ago
2006
IEEE
This work proposes a parallel memetic algorithm applied to the total tardiness single machine scheduling problem. Classical models of parallel evolutionary algorithms and the gene...
95
Voted
EUROCAST
2007
Springer
15 years 2 months ago
2007
Springer
RND (Radio Network Design) is an important problem in mobile telecommunications (for example in mobile/cellular telephony), being also relevant in the rising area of sensor network...
94
Voted
GPEM
2008
14 years 11 months ago
2008
In this work a cooperative, bid-based, model for problem decomposition is proposed with application to discrete action domains such as classification. This represents a significan...
92
Voted
EVOW
2001
Springer
15 years 3 months ago
2001
Springer
Augmenting an existing network with additional links to achieve higher robustness and survivability plays an important role in network design. We consider the problem of augmenting...
84
Voted
FOCS
2006
IEEE
15 years 5 months ago
2006
IEEE
In this paper we introduce a new general framework for set covering problems, based on the combination of randomized rounding of the (near-)optimal solution of the Linear Programm...