701 search results - page 15 / 141 » An Ant Algorithm for the Steiner Tree Problem in Graphs |
NETWORKS
1998
13 years 7 months ago
1998
WG
2001
Springer
13 years 11 months ago
2001
Springer
JISE
2006
13 years 7 months ago
2006
CIAC
2006
Springer
13 years 11 months ago
2006
Springer
JCO
2008
13 years 7 months ago
2008
We study Connected Facility Location problems. We are given a connected graph G = (V, E) with nonnegative edge cost ce for each edge e E, a set of clients D V such that each cli...