30 search results - page 4 / 6 » The Greedy Algorithm for the Symmetric TSP |
GECCO
2007
Springer
14 years 4 days ago
2007
Springer
Dividing the set of nodes into clusters in the well-known traveling salesman problem results in the generalized traveling salesman problem which seeking a tour with minimum cost p...
SODA
1998
ACM
13 years 7 months ago
1998
ACM
We develop data structures for dynamic closest pair problems with arbitrary (not necessarily geometric) distance functions, based on a technique previously used by the author for ...
WAOA
2005
Springer
13 years 11 months ago
2005
Springer
We study computational and coordination efficiency issues of Nash equilibria in symmetric network congestion games. We first propose a simple and natural greedy method that comput...
IWANN
2001
Springer
13 years 10 months ago
2001
Springer
This paper looks upon the standard genetic algorithm as an artificial self-organizing process. With the purpose to provide concepts that make the algorithm more open for scalabili...
TASE
2010
IEEE
13 years 22 days ago
2010
IEEE
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...