303 search results - page 15 / 61 » Traveling Salesman Problem with Transportation |
127
click to vote
CCE
2004
15 years 1 months ago
2004
The algorithmic framework developed for improving heuristic solutions of the new version of deterministic TSP [Choi et al., 2002] is extended to the stochastic case. To verify the...
120
Voted
EMO
2003
Springer
15 years 7 months ago
2003
Springer
This article proposes the Two-Phase Local Search for finding a good approximate set of non-dominated solutions. The two phases of this procedure are to (i) generate an initial sol...
123
click to vote
CCCG
2010
15 years 3 months ago
2010
In the Euclidean TSP with neighborhoods (TSPN), we are given a collection of n regions (neighborhoods) and we seek a shortest tour that visits each region. In the path variant, we...
100
Voted
IPL
2002
15 years 1 months ago
2002
This paper deals with the problem of constructing a Hamiltonian cycle of optimal weight, called TSP. We show that TSP is 2/3-differential approximable and can not be differential a...
77
Voted
WADS
2005
Springer
15 years 7 months ago
2005
Springer
