Traveling salesman - Open Access .click

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.
Boyd, Sylvia C., Cunningham, William H.
openaire +2 more sources

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.
Golden, B. +3 more
openaire +1 more source

The “molecular” traveling salesman

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

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.
Xu, Jinhui +3 more
openaire +1 more source

traveling salesman problem
combinatorial optimization
programming involving graphs or networks

genetic algorithm
fos: computer and information sciences
algorithm

tabu search
optimization
travelling salesman problem