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

全面介绍

书目详细资料

主要作者:	Cook, William, 1957-
企业作者:	ebrary, Inc
格式:	电子 电子书
语言:	英语
出版:	Princeton : Princeton University Press, 2012.
主题:	Traveling salesman problem. Computational complexity. Electronic books.
在线阅读:	An electronic book accessible through the World Wide Web; click to view
标签:	添加标签 没有标签, 成为第一个标记此记录!