Sciweavers

CSC
2009
13 years 4 months ago
An Empirical Analysis of Approximation Algorithms for Euclidean TSP
- The Traveling Salesman Problem (TSP) is perhaps the most famous optimization problem in the set NP-hard. Many problems that are natural applications in computer science and engin...
Bárbara Rodeker, M. Virginia Cifuentes, Lil...
SODA
2001
ACM
114views Algorithms» more  SODA 2001»
13 years 5 months ago
Approximation algorithms for TSP with neighborhoods 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. As a generalization of ...
Adrian Dumitrescu, Joseph S. B. Mitchell
CCCG
2010
13 years 5 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
GECCO
2005
Springer
143views Optimization» more  GECCO 2005»
13 years 9 months ago
Solving geometric TSP with ants
This paper presents an ant-based approach for solving the Traveling Salesman Problem (TSP). Novel concepts of this algorithm that distinguish it from the other heuristics are the ...
Thang Nguyen Bui, Mufit Colpan