Sciweavers

599 search results - page 1 / 120
» The traveling salesman problem
Sort
View
COCOON
2007
Springer
14 years 2 months ago
An Improved Exact Algorithm for Cubic Graph TSP
It is shown that the traveling salesman problem for graphs
Kazuo Iwama, Takuya Nakashima
HIS
2008
13 years 9 months ago
Solving the Railway Traveling Salesman Problem via a Transformation into the Classical Traveling Salesman Problem
The Railway Traveling Salesman Problem (RTSP) is a practical extension of the classical traveling salesman problem considering a railway network and train schedules. We are given ...
Bin Hu, Günther R. Raidl
EVOW
2005
Springer
14 years 1 months ago
Property Analysis of Symmetric Travelling Salesman Problem Instances Acquired Through Evolution
We show how an evolutionary algorithm can successfully be used to evolve a set of difficult to solve symmetric travelling salesman problem instances for two variants of the Lin-Ker...
Jano I. van Hemert
WADS
2005
Springer
187views Algorithms» more  WADS 2005»
14 years 1 months ago
Improved Approximation Algorithms for Metric Maximum ATSP and Maximum 3-Cycle Cover Problems
We consider an APX-hard variant (∆-Max-ATSP) and an APX-hard relaxation (Max-3-DCC) of the classical traveling salesman problem. We present a 31 40-approximation algorithm for â...
Markus Bläser, L. Shankar Ram, Maxim Sviriden...
CORR
2008
Springer
139views Education» more  CORR 2008»
13 years 7 months ago
Generalized Traveling Salesman Problem Reduction Algorithms
The generalized traveling salesman problem (GTSP) is an extension of the well-known traveling salesman problem. In GTSP, we are given a partition of cities into groups and we are ...
Gregory Gutin, Daniel Karapetyan