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

Cur síos iomlán

Sonraí bibleagrafaíochta

Príomhchruthaitheoir:	Cook, William, 1957-
Údar corparáideach:	ebrary, Inc
Formáid:	Leictreonach Ríomhleabhar
Teanga:	Béarla
Foilsithe / Cruthaithe:	Princeton : Princeton University Press, 2012.
Ábhair:	Traveling salesman problem. Computational complexity. Electronic books.
Rochtain ar líne:	An electronic book accessible through the World Wide Web; click to view
Clibeanna:	Cuir clib leis Níl clibeanna ann, Bí ar an gcéad duine le clib a chur leis an taifead seo!