The travelling salesman problem for finite-sized cities†

Authors:
Hugo Fort;Mordechai Kornbluth;Fredy Zypman
Affiliations:
Instituto de física, facultad de ciencias, universidad de la república, iguá 4225, montevideo 11400, uruguay email: hugo@fisica.edu.uy;Department of physics, yeshiva university, new york, u.s.a. email: mkornblu@yu.edu, zypman@yu.edu;Department of physics, yeshiva university, new york, u.s.a. email: mkornblu@yu.edu, zypman@yu.edu
Venue:
Mathematical Structures in Computer Science
Year:
2010

Citing 4
Cited 0

The TSP phase transition

Artificial Intelligence
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Approximation algorithms for TSP with neighborhoods in the plane

Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
Where the really hard problems are

IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a variation of the Travelling Salesman Problem (TSP) in which the cities visited have non-zero spatial extent, in contrast with the classical TSP, which has destinations that are mathematical points. This new approach opens up both new analyses of the problem and new algorithms for solutions, while remaining an economic first approximation to the standard problem. We present one particular solution that, depending on the number and size of the cities, can improve existing algorithms solving the classical TSP.