51
edits
Changes
Jump to navigation
Jump to search
Travelling Salesman Problem (view source)
Revision as of 20:35, December 28, 2007
, 20:35, December 28, 2007New page: The Travelling Salesman Problem is a problem that seeks to find the shortest way of getting through a network, starting from any point, visiting every other point, in the shortest ...
The [[Travelling Salesman Problem]] is a problem that seeks to find the shortest way of getting through a [[network]], starting from any point, visiting every other point, in the shortest time. It is commonly modelled as a network of [[arc]]s and [[node]]s.
It is a common example of an [[algorithm]] that has to be solved [[heuristic]]ally; while it is possible to solve it with brute force, by trying every single route and finding the shortest, this is impractical, since the number of routes increases [[factorial]]ly; while a 3-node network has only 6 routes, a 10-node one has 3,628,800.
[[Category:Mathematics]]
It is a common example of an [[algorithm]] that has to be solved [[heuristic]]ally; while it is possible to solve it with brute force, by trying every single route and finding the shortest, this is impractical, since the number of routes increases [[factorial]]ly; while a 3-node network has only 6 routes, a 10-node one has 3,628,800.
[[Category:Mathematics]]