Item Details
In Pursuit of the Traveling Salesman [electronic resource]: Mathematics at the Limits of Computation
William J. Cook
 Format
 EBook; Book; Online
 Published
 Princeton, N.J. : Princeton University Press, c2012.
 Language
 English
 ISBN
 9780691152707 (alk. paper), 0691152705 (alk. paper)
 Summary
 "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 mathematicsand 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 stateoftheart 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 isliterallya $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.
 "In Pursuit of the Traveling Salesman covers the history, applications, theory, and computation of the traveling salesman problem right up to stateoftheart solution machinery"Provided by publisher.
 Description
 Mode of access: World wide Web.
 Notes
 Includes bibliographical references (p. [223]224) and index.
 Copyright & PermissionsRights statements and licenses provide information about copyright and reuse associated with individual items in the collection.
 Copyright Not Evaluated
 Technical Details

 Access in Virgo Classic
 Staff View
LEADER 03113cam a22003854a 4500001 u6164461003 SIRSI005 20170308061700.0006 m d007 cr n008 110826s2012 njuab sb 001 0 eng da 2011030626a 015879100 2 Uka 9780691152707 (alk. paper)a 0691152705 (alk. paper)a (WaSeSS)ssj0000551477a DLC c DLC d YDX d BTCTA d UKMGB d PUL d YDXCP d BWX d DLC d WaSeSSa pcca QA164 b .C69 2012a 511/.5 2 23a MAT000000 a MAT025000 2 bisacsha Cook, William, d 1957a In pursuit of the traveling salesman h [electronic resource] : b mathematics at the limits of computation / c William J. Cook.a Princeton, N.J. : b Princeton University Press, c c2012.a Includes bibliographical references (p. [223]224) and index.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 mathematicsand 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 stateoftheart 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 isliterallya $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.a "In Pursuit of the Traveling Salesman covers the history, applications, theory, and computation of the traveling salesman problem right up to stateoftheart solution machinery"Provided by publisher.a Mode of access: World wide Web.a Traveling salesman problem.a Computational complexity.a Electronic books.a Safari Books Onlineu http://RE5QY4SB7X.search.serialssolutions.com/?V=1.0&L=RE5QY4SB7X&S=JCs&C=TC0000551477&T=marca 1a XX(6164461.1) w WEB i 61644611001 l INTERNET m UVALIB t INTERNET