Results 201 to 210 of about 4,258 (228)

Pyramidal traveling salesman problem

Computers & Operations Research, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Md. Fazle Baki, Santosh N. Kabadi
openaire   +1 more source

Submodularity and the traveling salesman problem

European Journal of Operational Research, 1999
Consider a central warehouse and a set \(V\) of retailers. For \(S \subseteq V\) let \(T(S)\) the length of an optimal traveling salesman tour through the retailers in \(S\) and the warehouse. The problem investigated is to find a submodular function \(K(S)\) and a small \(\alpha\) such that \(T(S)\leq K(S)\leq \alpha T(S)\) for all \(S\subseteq V ...
openaire   +2 more sources

Reoptimizing the traveling salesman problem

Networks, 2003
AbstractIn this paper, we study the reoptimization problems which arise when a new node is added to an optimal solution of a traveling salesman problem (TSP) instance or when a node is removed. We show that both reoptimization problems are NP‐hard. Moreover, we show that, while the cheapest insertion heuristic has a tight worst‐case ratio equal to 2 ...
ARCHETTI, Claudia, BERTAZZI, Luca, SPERANZA, Maria Grazia   +2 more
openaire   +3 more sources

Maximum travelling salesman problem

Mathematical Methods of Operations Research, 1996
Summary: We present different types of techniques for designing algorithms with worst-case performances for the Maximum Travelling Salesman Problem.
Vladimir Kotov, Michail M. Kovalev
openaire   +2 more sources

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

Some Applications of the Generalized Travelling Salesman Problem

Journal of the Operational Research Society, 1996
Gilbert Laporte, Ardavan Asef-Vaziri, Chelliah Sriskandarajah   +2 more
exaly