03025nam a2200385 a 4500001001000000003000700010005001700017006001900034007001500053008004100068010001700109020002900126020003500155035002200190035002300212035002500235035002300260035002100283040002700304050002100331082001500352100003400367245012800401260005200529300004900581504005100630520156200681533014702243650004002390650003702430655002902467710002802496856009602524999001902620EBC802242MiAaPQ20250821115247.0m     o  d |      cr cn|||||||||110826s2012    njuab   sb    001 0 eng d  z  2011030626  z9780691152707 (hardback)  a9781400839599 (electronic bk.)  a(MiAaPQ)EBC802242  a(Au-PeEL)EBL802242  a(CaPaEBR)ebr10514781  a(CaONFJC)MIL333977  a(OCoLC)768731903  aMiAaPQcMiAaPQdMiAaPQ 4aQA164b.C69 201204a511/.52231 aCook, William,d1957-937081710aIn pursuit of the traveling salesmanh[electronic resource] :bmathematics at the limits of computation /cWilliam J. Cook.  aPrinceton :bPrinceton University Press,c2012.  axiii, 228 p. :bill. (some col.), col. maps.  aIncludes bibliographical references 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 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"--cProvided by publisher.  aElectronic reproduction. Ann Arbor, MI : ProQuest, 2015. Available via World Wide Web. Access may be limited to ProQuest affiliated libraries. 0aTraveling salesman problem.9370818 0aComputational complexity.936729 4aElectronic books.9351422 aProQuest (Firm)937081940uhttps://ebookcentral.proquest.com/lib/kuct-ebooks/detail.action?docID=802242zClick to View  c277930d277930