Sciweavers

275 search results - page 15 / 55
» The Attractive Traveling Salesman Problem
Sort
View
CCE
2004
14 years 9 months ago
An algorithmic framework for improving heuristic solutions: Part II. A new version of the stochastic traveling salesman problem
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...
Jaein Choi, Jay H. Lee, Matthew J. Realff
EMO
2003
Springer
137views Optimization» more  EMO 2003»
15 years 2 months ago
A Two-Phase Local Search for the Biobjective Traveling Salesman Problem
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...
Luis Paquete, Thomas Stützle
CCCG
2010
14 years 11 months ago
The traveling salesman problem for lines and rays in the plane
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...
Adrian Dumitrescu
IPL
2002
118views more  IPL 2002»
14 years 9 months ago
Differential approximation results for the traveling salesman and related problems
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...
Jérôme Monnot
WADS
2005
Springer
78views Algorithms» more  WADS 2005»
15 years 3 months ago
The On-line Asymmetric Traveling Salesman Problem
Giorgio Ausiello, Vincenzo Bonifaci, Luigi Laura