Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 234,823,742 papers from all fields of science
Search
Sign In
Create Free Account
Travelling salesman problem
Known as:
Salesperson Problem
, Traveling salesmen problem
, Metric tsp
Expand
The travelling salesman problem (TSP) asks the following question: "Given a list of cities and the distances between each pair of cities, what is the…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
49 relations
3-opt
APX
Algorithmic efficiency
Ant colony optimization algorithms
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
Solving Traveling Salesman Problem by Genetic Algorithm
Wang Hui
2009
Corpus ID: 63090669
This paper introduces TSP problem and fundamental principle for genetic algorithm.Aiming at solving TSP problem,the paper…
Expand
2008
2008
On the Curvature-Constrained Traveling Salesman Problem
E. Feron
,
Emilio Frazzoli
2008
Corpus ID: 56268980
We study the traveling salesman problem for a Dubins car. We prove that this problem is NP-hard, and provide lower bounds on the…
Expand
2007
2007
Improved Clonal Algorithm and Its Application to Traveling Salesman Problem
Yunyi Zhu
,
Shangce Gao
,
Hongwei Dai
,
Fangjia Li
,
Zheng Tang
2007
Corpus ID: 5530648
To explain the essential features such as sufficient diversity, discrimination of self and non-self, and also long-lasting…
Expand
2005
2005
An Improved Evolutionary Algorithm for the Traveling Salesman Problem
Cai Zhi
2005
Corpus ID: 64521692
TSP(Traveling Salesman Problem) is one of the typical NP-hard problems in combinational optimization, and evolutionary algorithm…
Expand
1999
1999
The Travelling Salesman Problem on Permuted
R. Burkard
,
Vladimir G. De
,
G. Woeginger
1999
Corpus ID: 123618272
We consider traveling salesman problems (TSPs) with a permuted Monge matrix as cost matrix where the associated patching graph…
Expand
1988
1988
Two solvable cases of the Traveling Salesman Problem
G. Rothe
1988
Corpus ID: 14620863
In the Euclidean Traveling Salesman Problem, a set of points in the plane is given, and we look for a shortest closed curve…
Expand
1987
1987
Accelerated branch exchange heuristics for symmetric traveling salesman problems
W. Stewart
Networks
1987
Corpus ID: 45885866
A method for accelerating the computational performance of branch exchange heuristics for symmetric traveling salesman problems…
Expand
1980
1980
Visual Interactive (Computer) Solutions for the Travelling Salesman Problem
R. Hurrion
1980
Corpus ID: 62667796
A visual interactive method of improving solutions for the travelling salesman problem is described. The travelling or multiple…
Expand
Highly Cited
1972
Highly Cited
1972
Technical Note - Bounds for the Travelling-Salesman Problem
Nicos Christofides
Operational Research
1972
Corpus ID: 3029585
This paper concerns finding a tight lower bound to the travelling-salesman problem, with the hope that all the different branch…
Expand
1955
1955
Some Experiments on the Traveling-Salesman Problem
J. T. Robacker
1955
Corpus ID: 116990828
Abstract : This paper presents the results of a series of experiments on the traveling-salesman problem. The purpose of these…
Expand