Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Related topics

Related topics

49 relations
3-optAPXAlgorithmic efficiencyAnt colony optimization algorithms
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2007
Highly Cited
2007
The Traveling Salesman Problem: A Computational Study
As soon as you've downloaded an PDF or EPUB of The Traveling Salesman Problem A Computational Study By David L Applegate you… Expand
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Thermodynamical Approach to the Traveling Salesman Problem : An Efficient Simulation Algorithm
We present a Monte Carlo algorithm to find approximate solutions of the traveling salesman problem. The algorithm generates… Expand
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Ant colony system: a cooperative learning approach to the traveling salesman problem
This paper introduces the ant colony system (ACS), a distributed algorithm that is applied to the traveling salesman problem (TSP… Expand
  • figure 1
  • figure 2
  • figure 3
  • table I
  • figure 4
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Ant colonies for the traveling salesman problem
We describe an artificial ant colony capable of solving the traveling salesman problem (TSP). Ants of the artificial colony are… Expand
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
Highly Cited
1991
Highly Cited
1991
TSPLIB - A Traveling Salesman Problem Library
This paper contains the description of a traveling salesman problem library (TSPLIB) which is meant to provide researchers with a… Expand
Is this relevant?
Highly Cited
1976
Highly Cited
1976
Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem
Abstract : An O(n sup 3) heuristic algorithm is described for solving n-city travelling salesman problems (TSP) whose cost matrix… Expand
Is this relevant?
Highly Cited
1973
Highly Cited
1973
An Effective Heuristic Algorithm for the Traveling-Salesman Problem
This paper discusses a highly effective heuristic procedure for generating optimum and near-optimum solutions for the symmetric… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1970
Highly Cited
1970
The Traveling-Salesman Problem and Minimum Spanning Trees
This paper explores new approaches to the symmetric traveling-salesman problem in which 1-trees, which are a slight variant of… Expand
Is this relevant?
Highly Cited
1960
Highly Cited
1960
Integer Programming Formulation of Traveling Salesman Problems
It has been observed by many people that a striking number of quite diverse mathematical problems can be formulated as problems… Expand
Is this relevant?
Highly Cited
1954
Highly Cited
1954
Solution of a Large-Scale Traveling-Salesman Problem
The RAND Corporation in the early 1950s contained “what may have been the most remarkable group of mathematicians working on… Expand
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE