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 ...
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...
We describe a new approximation algorithm for the asymmetric maximum traveling salesman problem (ATSP) with triangle inequality. Our algorithm achieves approximation factor 35/44 ...