In pursuit of the traveling salesman mathematics at the limits of computation /

"What is the shortest possible route for a traveling salesman seeking to visit each city on a list exactly once and return to his city of origin? It sounds simple enough, yet the traveling salesman problem is one of the most intensely studied puzzles in applied mathematics--and it has defied so...

Disgrifiad llawn

Wedi'i Gadw mewn:
Manylion Llyfryddiaeth
Prif Awdur: Cook, William, 1957-
Awdur Corfforaethol: ebrary, Inc
Fformat: Electronig eLyfr
Iaith:Saesneg
Cyhoeddwyd: Princeton : Princeton University Press, 2012.
Pynciau:
Mynediad Ar-lein:An electronic book accessible through the World Wide Web; click to view
Tagiau: Ychwanegu Tag
Dim Tagiau, Byddwch y cyntaf i dagio'r cofnod hwn!