Results 131 to 140 of about 11,422 (178)

The Traveling Salesman Problem with Backhauls

Computers & Operations Research, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michel Gendreau, Alain Hertz, Gilbert Laporte   +2 more
openaire   +1 more source

On the Dubins Traveling Salesman Problem

IEEE Transactions on Automatic Control, 2012
We study the traveling salesman problem for a Dubins vehicle. We prove that this problem is NP-hard, and provide lower bounds on the approximation ratio achievable by some recently proposed heuristics. We also describe new algorithms for this problem based on heading discretization, and evaluate their performance numerically.
Jerome Le Ny, Eric Feron, Emilio Frazzoli   +2 more
openaire   +1 more source

Small Travelling Salesman Polytopes

Mathematics of Operations Research, 1991
We introduce a new class of valid inequalities for the polytope of the symmetric travelling salesman problem. We also gave complete characterizations of the polytope for 6 and 7 cities. For the latter case, the new inequalities are needed. These results are related to work of R. Z. Norman in the 1950's.
Sylvia C. Boyd, William H. Cunningham
openaire   +2 more sources

The “molecular” traveling salesman

Biological Cybernetics, 1990
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

On the Tours of a Traveling Salesman

SIAM Journal on Control, 1969
Adjacency properties of tours on their convex hull are discussed. A rule is given by which it can be tested whether any two tours are adjacent vertices on this convex hull or not. Based on this rule an algorithm is described for generating all the adjacent tours of a given tour.
openaire   +1 more source

The Traveling Salesman Problem: A Survey

Operations Research, 1968
A survey and synthesis of research on the traveling salesman problem is given. We begin by defining the problem and presenting several theorems. This is followed by a general classification of the solution techniques and a detailed description of some of the proven methods. Finally a summary of computational results is given.
Mandell Bellmore, George L. Nemhauser
openaire   +1 more source

Approximate Traveling Salesman Algorithms

Operations Research, 1980
There have been a multitude of heuristic algorithms proposed for the solution of large scale traveling salesman problems. Our intent in this paper is to examine some of these well known heuristics, to introduce some new heuristics, and to compare these approximate techniques on the basis of efficiency and accuracy.
Bruce L. Golden, Lawrence Bodin, T. Doyle, W. Stewart Jr.   +3 more
openaire   +1 more source

The Case of the Traveling Salesman

Scientific American, 2012
The article discusses how a seemingly unsolvable mathematical problem, called the traveling salesman problem (TSP), offers insight into the limits of computation. An overview of the TSP problem and a computational tool, called linear programming, that assigns fractions to roads that join in pairs of cities rather than deciding whether to use the road ...
openaire   +2 more sources

Transformation of the generalized traveling-salesman problem into the standard traveling-salesman problem

Information Sciences, 1993
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yao-Nan Lien, Y. W. Eva Ma, Benjamin W. Wah   +2 more
openaire   +3 more sources

Traveling Salesman Problem with Clustering

Journal of Statistical Physics, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Schneider, Johannes J., Bukur, Thomas, Krause, Antje   +2 more
openaire   +1 more source