Results 161 to 170 of about 8,730 (184)

Aspects of the traveling salesman problem

IBM Journal of Research and Development, 1984
The traveling salesman problem is one of the simplest to state but hardest to solve problems in the area of optimization. Many of its aspects starting from an early statement of Menger in 1930 till a rough description of an implementation of a code by Crowder and Padberg which successfully tackled a 318-city problem in 1980 have been gathered ...
Michael Held, Alan J. Hoffman, Ellis Lane Johnson, Philip Wolfe   +3 more
openaire   +2 more sources

An efficient transformation of the generalized traveling salesman problem into the traveling salesman problem on digraphs

Information Sciences, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Vladimir Dimitrijevic, Zoran Saric
openaire   +2 more sources

Traveling Salesman Problem of Segments

2003
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, Yang Yang 0012, Zhiyong Lin   +2 more
openaire   +1 more source

A Note on the Traveling Salesman Problem

SIAM Journal on Applied Mathematics, 1977
It is shown that the “shortest” directed Hamiltonian tour in a graph G with metrically realizable distances has the property that between any vertex and its nearest neighbor in that tour there must be a vertex $v_0 $ from which the succeeding arc in the tour is no more than twice as long as the shortest arc from $v_0 $ in G Some related results and ...
openaire   +2 more sources

Solving Traveling Salesman Problems

2002
Given the cost of travel between each pair of a finite number of cities, the traveling salesman problem (TSP) is to find the cheapest tour passing through all of the cities and returning to the point of departure. We will present a survey of recent progress in algorithms for large-scale TSP instances, including the solution of a million city instance ...
openaire   +1 more source

A comprehensive survey on the Multiple Traveling Salesman Problem: Applications, approaches and taxonomy

Computer Science Review, 2021
Omar Cheikhrouhou, Inés Khoufi
exaly  

A transformation technique for the clustered generalized traveling salesman problem with applications to logistics

European Journal of Operational Research, 2020
Pouya Baniasadi, Mehdi Foumani, Kate Smith-Miles   +2 more
exaly  

TSPLIB—A Traveling Salesman Problem Library

ORSA Journal on Computing, 1991
Gerhard Reinelt
exaly  

The traveling salesman problem: An overview of exact and approximate algorithms

European Journal of Operational Research, 1992
Gilbert Laporte
exaly  

A Priori Optimization of the Probabilistic Traveling Salesman Problem

Operations Research, 1994
Gilbert Laporte, Hélène Mercure
exaly