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

Volledige beschrijving

Bewaard in:
Bibliografische gegevens
Hoofdauteur: Cook, William, 1957-
Coauteur: ebrary, Inc
Formaat: Elektronisch E-boek
Taal:Engels
Gepubliceerd in: Princeton : Princeton University Press, 2012.
Onderwerpen:
Online toegang:An electronic book accessible through the World Wide Web; click to view
Tags: Voeg label toe
Geen labels, Wees de eerste die dit record labelt!