Results 141 to 150 of about 8,730 (184)

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

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

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

Risky traveling salesman problem

European Journal of Operational Research, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nikolaos Papadakos, George Tzallas-Regas, Berç Rustem, Joanne Thoms   +3 more
openaire   +2 more sources

TRAVELING SALESMAN PROBLEM OF SEGMENTS

International Journal of Computational Geometry & Applications, 2004
In 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, Zhiyong Lin, Yang Yang 0012, Ronald Berezney   +3 more
openaire   +1 more source

Traveling Salesman Problems with Profits

Transportation Science, 2005
Traveling 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, Pierre Dejax, Michel Gendreau   +2 more
openaire   +1 more source

The landscape of the traveling salesman problem

Physics Letters A, 1992
Abstract 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

The traveling-salesman problem (abstract)

Proceedings of the 1990 ACM annual conference on Cooperation - CSC '90, 1990
The traveling-salesman problem is one of the classical NP-Complete problems. No current algorithms are available which can solve these problems in polynomial time, that is, the number of steps grows as a polynomial according to the size of the input. The traveling-salesman problem involves a salesman who must make a tour of a number of cities using the
Susan N. Twohig, Samuel O. Aletan
openaire   +1 more source

Today's Traveling Salesman Problem

IEEE Robotics & Automation Magazine, 2010
Heterogeneous 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, Sivakumar Rathinam, Swaroop Darbha   +2 more
openaire   +1 more source