1298 search results - page 69 / 260 » The online set cover problem |
167
click to vote
GECCO
2007
Springer
16 years 16 days ago
2007
Springer
In this paper, we propose the combination of different optimization techniques in order to solve “hard” two- and threeobjective optimization problems at a relatively low comp...
173
click to vote
ESA
2008
Springer
15 years 8 months ago
2008
Springer
For a set P of n points in R2 , the Euclidean 2-center problem computes a pair of congruent disks of the minimal radius that cover P. We extend this to the (2, k)-center problem wh...
153
click to vote
COR
2008
15 years 6 months ago
2008
The typical inventory routing problem deals with the repeated distribution of a single product from a single facility with an unlimited supply to a set of customers that can all b...
166
click to vote
HM
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. In this work we extend a VNS for the periodic vehicle routing problem with time windows (PVRPTW) to a multiple VNS (mVNS) where several VNS instances are applied cooperat...
199
click to vote
EC
2008
15 years 6 months ago
2008
We consider an optimization problem of finding the best possible offspring as a result of a recombination operator in an evolutionary algorithm, given two parent solutions. The op...