35 search results - page 1 / 7 » The Traveling Salesman Problem with Few Inner Points |
COCOON
2004
Springer
13 years 10 months ago
2004
Springer
IWPEC
2004
Springer
13 years 10 months ago
2004
Springer
We propose to look at the computational complexity of 2-dimensional geometric optimization problems on a finite point set with respect to the number of inner points (that is, poi...
NCA
2008
IEEE
13 years 4 months ago
2008
IEEE
The paper focuses on the study of solving the large-scale traveling salesman problem (TSP) based on neurodynamic programming. From this perspective, two methods, temporal differenc...
ICNC
2009
Springer
13 years 11 months ago
2009
Springer
—Genetic algorithm (GA) is too dependent on the initial population and a lack of local search ability. In this paper, an improved greedy genetic algorithm (IGAA) is proposed to o...
IPCO
2001
13 years 6 months ago
2001
Problem (Extended Abstract) Cliff Stein David P. Wagner Dartmouth College Computer Science Technical Report TR2000-367 May 9, 2000 The problem of traversing a set of points in the...