Sciweavers

40 search results - page 1 / 8
» The On-line Asymmetric Traveling Salesman Problem
Sort
View
65
Voted
COCOON
2004
Springer
15 years 3 months ago
Algorithms for the On-Line Quota Traveling Salesman Problem
Giorgio Ausiello, Marc Demange, Luigi Laura, Vange...
HIS
2008
14 years 12 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
TOC
2008
95views more  TOC 2008»
14 years 10 months ago
On the LP Relaxation of the Asymmetric Traveling Salesman Path Problem
: This is a comment on the article "An O(logn) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem" by C. Chekuri and M. P
Viswanath Nagarajan
DISOPT
2006
110views more  DISOPT 2006»
14 years 10 months ago
New facets of the STS polytope generated from known facets of the ATS polytope
While it was known for a long time how to transform an asymmetric traveling salesman problem on the complete graph with n vertices into a symmetric traveling salesman problem on a...
Egon Balas, Robert Carr, Matteo Fischetti, Neil Si...
WADS
2007
Springer
189views Algorithms» more  WADS 2007»
15 years 4 months ago
35/44-Approximation for Asymmetric Maximum TSP with Triangle Inequality
We describe a new approximation algorithm for the asymmetric maximum traveling salesman problem (ATSP) with triangle inequality. Our algorithm achieves approximation factor 35/44 ...
Lukasz Kowalik, Marcin Mucha