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

Deskribapen osoa

Xehetasun bibliografikoak

Egile nagusia:	Cook, William, 1957-
Erakunde egilea:	ebrary, Inc
Formatua:	Baliabide elektronikoa eBook
Hizkuntza:	ingelesa
Argitaratua:	Princeton : Princeton University Press, 2012.
Gaiak:	Traveling salesman problem. Computational complexity. Electronic books.
Sarrera elektronikoa:	An electronic book accessible through the World Wide Web; click to view
Etiketak:	Etiketa erantsi Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!