Results 191 to 200 of about 4,732 (227)
Some of the next articles are maybe not open access.
TRAVELING SALESMAN PROBLEM OF SEGMENTS
International Journal of Computational Geometry & Applications, 2004In this paper, we present a polynomial time approximation scheme (PTAS) for a variant of the traveling salesman problem (called segment TSP) in which a traveling salesman tour is sought to traverse a set of n ∊-separated segments in two dimensional space.
Jinhui Xu 0001 +3 more
openaire +1 more source
On the core of traveling salesman games
Operations Research Letters, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lei Sun, Mark H. Karwan
openaire +2 more sources
Traveling Salesman Problems with Profits
Transportation Science, 2005Traveling salesman problems with profits (TSPs with profits) are a generalization of the traveling salesman problem (TSP), where it is not necessary to visit all vertices. A profit is associated with each vertex. The overall goal is the simultaneous optimization of the collected profit and the travel costs.
Dominique Feillet +2 more
openaire +1 more source
The landscape of the traveling salesman problem
Physics Letters A, 1992Abstract The landscapes of traveling salesman problems are investigated by random walk techniques. The autocorrelation functions for different metrics on the space of tours are calculated. The landscape turns out to be AR(1) for symmetric TSPs. For asymmetric problems there can be a random contribution superimposed on an AR(1) behaviour.
Stadler, P., Schnabel, W.
openaire +3 more sources
Today's Traveling Salesman Problem
IEEE Robotics & Automation Magazine, 2010Heterogeneous unmanned aerial vehicles (UAVs) are being developed for several civil and military applications. These vehicles can differ either in their motion constraints or sensing/attack capabilities. This article uses methods from operations research to address a fundamental routing problem involving heterogeneous UAVs. The approach is to transform
Paul Oberlin +2 more
openaire +1 more source
Traveling with the Salesman...
2018The travelling salesman problem is a classic spatial optimization problem: Given a list of cities, the distance between each pair of cities, and a designated origin city, what is the shortest path connecting each city that terminates at the origin city? It is an instance of the quadratic assignment problem, which is one of the fundamental combinatorial
Daniel A. Griffith, Jean H. P. Paelinck
openaire +1 more source
On The Approximability Of The Traveling Salesman Problem
Combinatorica, 2006We show that the traveling salesman problem with triangle inequality cannot be approximated with a ratio better than $$\frac{{117}}{{116}}$$ when the edge lengths are allowed to be asymmetric and $$\frac{{220}}{{219}}$$ when the edge lengths are symmetric, unless P=NP.
Christos H. Papadimitriou +1 more
openaire +1 more source
The greedy travelling salesman's problem
Networks, 1979AbstractThe Travelling Salesman's Problem is to find a Hamilton path (or circuit) which has minimum total weight W*, in a graph (or digraph) with a non‐negative weight on each edge. The Greedy Travelling Salesman's Problem is “How much larger than W* can the total weight G* of the solution obtained by the Greedy Algorithm be?”.
openaire +2 more sources
The clustered traveling salesman problem
Computers & Operations Research, 1975Abstract The traveling salesman problem is expanded to include the situation where a group of cities (cluster) must be visited contiguously in an optimal, unspecified order. Given several sets of clusters within the problem, a method is developed for optimizing simultaneously the ordering of cities within each cluster and the ordering of clusters.
openaire +1 more source
On inverse traveling salesman problems
4OR, 2012zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yerim Chung, Marc Demange
openaire +2 more sources