000			02957cam a22003374a 4500
001			16936233
003			IIITD
005			20170530153021.0
008			110826s2012 njuab b 001 0 eng
010			_a 2011030626
016	7		_a015879100 _2Uk
020			_a9780691163529
035			_a(OCoLC)ocn724663194
040			_aDLC _cDLC _dYDX _dBTCTA _dUKMGB _dPUL _dYDXCP _dBWX _dDLC
042			_apcc
050	0	0	_aQA164 _b.C69 2012
082	0	0	_a511.5 _223 _bCOO-I
084			_aMAT000000 _aMAT025000 _2bisacsh
100	1		_aCook, William
245	1	0	_aIn pursuit of the traveling salesman : _bmathematics at the limits of computation _cWilliam J. Cook
260			_aNew jersey : _bPrinceton University Press, _c©2012
300			_axiii, 228 p. : _bill. ; _c24 cm.
504			_aIncludes bibliographical references (p. [223]-224) and index.
520			_a"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 solution to this day. In this book, William Cook takes readers on a mathematical excursion, picking up the salesman's trail in the 1800s when Irish mathematician W. R. Hamilton first defined the problem, and venturing to the furthest limits of today's state-of-the-art attempts to solve it. Cook examines the origins and history of the salesman problem and explores its many important applications, from genome sequencing and designing computer processors to arranging music and hunting for planets. He looks at how computers stack up against the traveling salesman problem on a grand scale, and discusses how humans, unaided by computers, go about trying to solve the puzzle. Cook traces the salesman problem to the realms of neuroscience, psychology, and art, and he also challenges readers to tackle the problem themselves. The traveling salesman problem is--literally--a $1 million question. That's the prize the Clay Mathematics Institute is offering to anyone who can solve the problem or prove that it can't be done. In Pursuit of the Traveling Salesman travels to the very threshold of our understanding about the nature of complexity, and challenges you yourself to discover the solution to this captivating mathematical problem"--Provided by publisher.
520			_a"In Pursuit of the Traveling Salesman covers the history, applications, theory, and computation of the traveling salesman problem right up to state-of-the-art solution machinery"--Provided by publisher.
650		0	_aTraveling salesman problem.
650		0	_aComputational complexity.
906			_a7 _bcbc _corignew _d1 _eecip _f20 _gy-gencatlg
942			_2ddc _cBK
999			_c23424 _d23424