613 search results - page 22 / 123 » Generalized Traveling Salesman Problem Reduction Algorithms |
168
click to vote
ENDM
2010
15 years 5 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...
135
Voted
JUCS
2010
15 years 3 months ago
2010
Abstract: This paper discusses three rectilinear (that is, axis-parallel) covering problems in d dimensions and their variants. The first problem is the Rectilinear Line Cover whe...
186
click to vote
CORR
2011
Springer
15 years 11 days ago
2011
Springer
The paper describes a general glance to the use of element exchange techniques for optimization over permutations. A multi-level description of problems is proposed which is a fund...
150
click to vote
IPPS
2002
IEEE
15 years 10 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...
145
click to vote
ICALP
2005
Springer
15 years 11 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...