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 solutio...

Descrizione completa

Dettagli Bibliografici

Autore principale:	Cook, William, 1957-
Ente Autore:	ebrary, Inc
Natura:	Elettronico eBook
Lingua:	inglese
Pubblicazione:	Princeton : Princeton University Press, 2012.
Soggetti:	Traveling salesman problem. Computational complexity. Electronic books.
Accesso online:	An electronic book accessible through the World Wide Web; click to view
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!