travelling_salesman_problem
Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision | ||
|
travelling_salesman_problem [2017/04/05 23:01] sertalpbilal old revision restored (2015/10/28 11:30) |
travelling_salesman_problem [2024/04/17 15:30] (current) 47.128.49.104 old revision restored (2024/03/14 10:56) |
||
|---|---|---|---|
| Line 1: | Line 1: | ||
| ====== Travelling salesman problem ====== | ====== Travelling salesman problem ====== | ||
| - | |||
| - | < | ||
| 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, | 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, | ||
travelling_salesman_problem.1491447704.txt.gz ยท Last modified: 2017/04/05 23:01 by sertalpbilal
Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Share Alike 4.0 International
