
The Traveling Salesman Problem : A Computational Study
9780691129938 Princeton Series in Applied Mathematics Innbundet
04.02.2007
Engelsk
I salg
Oppdatert 30.1. Klikk her for info om bokleveranser, faktura og nettbutikk

Heftet
Leveringstid: 7-30 dager
Omtale
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 solution to this day. In this book, William Cook takes rea
09.11.2014
9780691163529
, Engelsk
248
15.9 cm
23.3 cm