Skip to search formSkip to main contentSkip to account menu

Travelling salesman problem

Known as: Salesperson Problem, Traveling salesmen problem, Metric tsp 
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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
Biogeography-based optimization algorithm(BBO) is a new kind of optimization algorithm based on Biogeography. It mimics the… 
2004
2004
Dynamic optimisation problems are becoming increasingly important; meanwhile, progress in optimisation techniques and in… 
1999
1999
We consider traveling salesman problems (TSPs) with a permuted Monge matrix as cost matrix where the associated patching graph… 
1996
1996
The Clustered Traveling Salesman Problem is an extension of the classical Traveling Salesman Problem, where the set vertices is… 
Review
1993
Review
1993
We briefly review the state of the art of applying neural networks to find approximate solutions to the travelling salesman… 
1992
1992
This paper provides a substantial proof th at genet ic algorithms (GAs) work for t he traveling salesman problem (TSP) . The… 
1992
1992
This paper presents a method developed for the multiple traveling salesman problem (m-TSP), which is a generalization of the well… 
1976
1976
The problem of locating a single new facility relative to existing facilities has been studied extensively under the assumption… 
Highly Cited
1972
Highly Cited
1972
This paper concerns finding a tight lower bound to the travelling-salesman problem, with the hope that all the different branch… 
Highly Cited
1971
Highly Cited
1971
The traveling-salesman problem has been the target of a substantial number of computational algorithms over the last two decades…