Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,740,550 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.
2010
2010
Biogeography based optimization for Traveling Salesman Problem
Hongwei Mo
,
Lifang Xu
Sixth International Conference on Natural…
2010
Corpus ID: 27053633
Biogeography-based optimization algorithm(BBO) is a new kind of optimization algorithm based on Biogeography. It mimics the…
Expand
2004
2004
Benchmarking algorithms for dynamic travelling salesman problems
Lishan Kang
,
Aimin Zhou
,
R. I. McKay
,
Yan Li
,
Zhuo Kang
Proceedings of the Congress on Evolutionary…
2004
Corpus ID: 15358941
Dynamic optimisation problems are becoming increasingly important; meanwhile, progress in optimisation techniques and in…
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
1996
1996
The Clustered Traveling Salesman Problem: A Genetic Approach
J. Potvin
,
F. Guertin
1996
Corpus ID: 118682487
The Clustered Traveling Salesman Problem is an extension of the classical Traveling Salesman Problem, where the set vertices is…
Expand
Review
1993
Review
1993
Neural Networks and the Travelling Salesman Problem
E. Aarts
,
E. Aarts
,
H. P. Stehouwer
1993
Corpus ID: 63113074
We briefly review the state of the art of applying neural networks to find approximate solutions to the travelling salesman…
Expand
1992
1992
Schema Analysis of the Traveling Salesman Problem Using Genetic Algorithms
A. Homaifar
,
Shanguchuan Guan
,
G. Liepins
Complex Systems
1992
Corpus ID: 9878767
This paper provides a substantial proof th at genet ic algorithms (GAs) work for t he traveling salesman problem (TSP) . The…
Expand
1992
1992
Exact Solution of Multiple Traveling Salesman Problem
I. Branco
,
J. Santos
,
J. Paixão
1992
Corpus ID: 118989682
This paper presents a method developed for the multiple traveling salesman problem (m-TSP), which is a generalization of the well…
Expand
1976
1976
TRAVELING SALESMAN LOCATION PROBLEM
Robert Burness
,
John A. White
1976
Corpus ID: 59948840
The problem of locating a single new facility relative to existing facilities has been studied extensively under the assumption…
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
Highly Cited
1971
Highly Cited
1971
Pathology of Traveling-Salesman Subtour-Elimination Algorithms
M. Bellmore
,
J. Malone
Operational Research
1971
Corpus ID: 36021664
The traveling-salesman problem has been the target of a substantial number of computational algorithms over the last two decades…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE