201 search results - page 19 / 41 » Algorithms for the On-Line Quota Traveling Salesman Problem |
117
click to vote
ENDM
2010
14 years 12 months ago
2010
Abstract We study the version of the asymmetric prize collecting traveling salesman problem, where the objective is to find a directed tour that visits a subset of vertices such th...
APPROX
2010
Springer
15 years 1 months ago
2010
Springer
We consider two natural generalizations of the Asymmetric Traveling Salesman problem: the k-Stroll and the k-Tour problems. The input to the k-Stroll problem is a directed n-verte...
GECCO
2007
Springer
15 years 6 months ago
2007
Springer
We propose a protocol for a local search and a genetic algorithm for the distributed traveling salesman problem (TSP). In the distributed TSP, information regarding the cost funct...
IPPS
2002
IEEE
15 years 4 months ago
2002
IEEE
We introduce a new method to estimate the Java object activity in a distributed context of irregular applications. This method uses an observation mechanism which is itself a part...
ICALP
2005
Springer
15 years 5 months ago
2005
Springer
In the Euclidean group Traveling Salesman Problem (TSP), we are given a set of points P in the plane and a set of m connected regions, each containing at least one point of P. We w...