895 search results - page 15 / 179 » An Indirect Genetic Algorithm for Set Covering Problems |
COMGEO
2008
ACM
13 years 7 months ago
2008
ACM
We study the following problem: Given a set of red points and a set of blue points on the plane, find two unit disks CR and CB with disjoint interiors such that the number of red ...
DCOSS
2008
Springer
13 years 9 months ago
2008
Springer
We present the first local approximation schemes for maximum independent set and minimum vertex cover in unit disk graphs. In the graph model we assume that each node knows its geo...
ALGORITHMICA
2010
13 years 7 months ago
2010
T. Rado conjectured in 1928 that if S is a finite set of axis-parallel squares in the plane, then there exists an independent subset I S of pairwise disjoint squares, such that I ...
GECCO
1999
Springer
13 years 11 months ago
1999
Springer
Infrastructure management offices plan and complete several thousand small construction projects annually. Effective planning is vital if the public and private sectors are to mai...
COR
2007
13 years 7 months ago
2007
The paper discusses the definition and solution of a bi-objective routing problem, namely the bi-objective covering tour problem. The bi-objective CTP is a generalization of the ...