Zobrazeno 1 - 1
of 1
pro vyhledávání: '"CASE-BASED TOUR FINDER"'
Autor:
Hossein Erfani
Publikováno v:
Iranian Journal of Optimization, Vol 02, Iss 1, Pp 151-161 (2009)
Imagine you have traveled to an unfamiliar city. Before you start your daily tour around the city, you need to know a good route. In Network Theory (NT), this is the traveling salesman problem (TSP). A dynamic programming algorithm is often used for
Externí odkaz:
https://doaj.org/article/0a84ddb142714565a7fd8a877140859a
