User Tools

Site Tools


travelling_salesman_problem

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
travelling_salesman_problem [2014/09/23 22:48]
sertalpbilal
travelling_salesman_problem [2018/10/01 13:29] (current)
bsuresh old revision restored (2017/04/05 23:01)
Line 1: Line 1:
 ====== Travelling salesman problem ====== ====== Travelling salesman problem ======
 +
 +<​note>​This is a playground page for new users. Feel free to edit here!</​note>​
  
 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 shortest possible route that visits each city exactly once and returns to the origin city? It is an NP-hard problem in combinatorial optimization,​ important in operations research and theoretical computer science. 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 shortest possible route that visits each city exactly once and returns to the origin city? It is an NP-hard problem in combinatorial optimization,​ important in operations research and theoretical computer science.
travelling_salesman_problem.1411526904.txt.gz ยท Last modified: 1998/12/03 12:11 (external edit)