Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Rao, V. N. Vimal"'
Autor:
Marupudi, Vijay, Harsch, Rina, Rao, V. N. Vimal, Park, Jimin, Bye, Jeffrey K., Varma, Sashank
Publikováno v:
Proceedings of the Annual Meeting of the Cognitive Science Society, vol 44, iss 44
The traveling salesperson problem (TSP) is an NP-Hard problem that computers find difficult to solve. Humans are surprisingly good at solving the TSP, with solutions within 10% of optimal for problems with up to 100 points, constructed in time linear
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______325::cc10391a9ebce8d06855a19dd7d61b60
https://escholarship.org/uc/item/3t16j57m
https://escholarship.org/uc/item/3t16j57m