Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Debreceni, Bálint"'
Publikováno v:
Annales Mathematicae et Informaticae; 2018, Vol. 48, p33-42, 10p
The TSP is the problem to find the shortest path in a graph visiting every nodes exactly once and returning to the start node. Due to the high complexity of TSP, there exists no algorithm for global exact optimization with polynomial cost. In order
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3812::ead7aa030ad137c461a5af6ce4e72742
http://publikacio.uni-eszterhazy.hu/3311/
http://publikacio.uni-eszterhazy.hu/3311/
