252 search results - page 51 / 51 » tsp 2008 |
127
Voted
FOCS
2008
IEEE
15 years 7 months ago
2008
IEEE
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...
101
Voted
GECCO
2008
Springer
15 years 1 months ago
2008
Springer
The correct choice of an evolutionary algorithm, a genetic representation for the problem being solved (as well as their associated variation operators) and the appropriate values...