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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1953-2018
010020030019532017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2004
Highly Cited
2004
We present a Monte Carlo algorithm to find approximate solutions of the traveling salesman problem. The algorithm generates… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2003
Highly Cited
2003
We discuss several issues that arise in the implementation of Martin, Otto, and Felten's Chained Lin-Kernighan heuristic for… (More)
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Ant algorithms [18, 14, 19] are a recently developed, population-based approach which has been successfully applied to several NP… (More)
  • figure 1.1
  • figure 1.3
  • table 1.1
  • table 1.2
Is this relevant?
Highly Cited
1997
Highly Cited
1997
We describe an artificial ant colony capable of solving the traveling salesman problem (TSP). Ants of the artificial colony are… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
Highly Cited
1997
Highly Cited
1997
This paper introduces ant colony system (ACS), a distributed algorithm that is applied to the traveling salesman problem (TSP… (More)
  • figure 1
  • figure 2
  • figure 3
  • table I
  • figure 4
Is this relevant?
Highly Cited
1991
Highly Cited
1991
An algorithm is described for solving large-scale instances of the Symmetric Traveling Salesman Problem (STSP) to optimality. The… (More)
  • figure 3
  • figure 4
  • figure 6
  • table 2
  • figure 7
Is this relevant?
Highly Cited
1973
Highly Cited
1973
An Eflective Heuristic Algorithm for the Traveling. THE SYMMETRIC traveling-salesman problem is: Given an n by n symmetric matrix… (More)
Is this relevant?
Highly Cited
1962
Highly Cited
1962
The well-known travelling salesman problem is the following: " A salesman is required ~,o visit once and only once each of n… (More)
Is this relevant?
Highly Cited
1960
Highly Cited
1960
It has been observed by many people that a striking number of quite diverse mathematical problems can be formulated as problems… (More)
Is this relevant?
Highly Cited
1954
Highly Cited
1954
The RAND Corporation in the early 1950s contained “what may have been the most remarkable group of mathematicians working on… (More)
Is this relevant?