203 search results - page 7 / 41 » tsp 2010 |
TCS
2010
14 years 8 months ago
2010
We give an O(n2 m + nm2 + m2 log m) time and O(n2 + m2 ) space algorithm for finding the shortest traveling salesman tour through the vertices of two simple polygonal obstacles i...
101
click to vote
CIAC
2010
Springer
15 years 1 months ago
2010
Springer
In this paper, we consider variants of the traveling salesman problem with precedence constraints. We characterize hard input instances for Christofides' algorithm and Hoogeve...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
STSP seeks a pair of pickup and delivery tours in two distinct networks, where the two tours are related by LIFO contraints. We address here the problem approximability. We notabl...
AAIM
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. This paper presents an iterative, highly parallelizable approach to find good tours for very large instances of the Euclidian version of the well-known Traveling Salesma...
CCCG
2010
14 years 11 months ago
2010
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...