599 search results - page 7 / 120 » The traveling salesman problem |
ANTSW
2006
Springer
13 years 11 months ago
2006
Springer
There are two reasons for parallelizing a metaheuristic if one is interested in performance: (i) given a fixed time to search, the aim is to increase the quality of the solutions f...
MOR
2010
13 years 6 months ago
2010
We extend the work of Letchford (2000) by introducing a new class of valid inequalities for the traveling salesman problem, called the generalized domino-parity (GDP) constraints....
NCA
2008
IEEE
13 years 7 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...
IPCO
2001
13 years 9 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...
PDCAT
2005
Springer
14 years 1 months ago
2005
Springer
This paper describes how to solve very large TravelingSalesman Problems heuristically by the parallelization of self-organizing maps on cluster architectures. The used way of para...