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

Ausführliche Beschreibung

Bibliographische Detailangaben

1. Verfasser:	Cook, William, 1957-
Körperschaft:	ebrary, Inc
Format:	Elektronisch E-Book
Sprache:	Englisch
Veröffentlicht:	Princeton : Princeton University Press, 2012.
Schlagworte:	Traveling salesman problem. Computational complexity. Electronic books.
Online-Zugang:	An electronic book accessible through the World Wide Web; click to view
Tags:	Tag hinzufügen Keine Tags, Fügen Sie das erste Tag hinzu!