LEADER 03949nam 2200697 a 450 001 9910817645403321 005 20200520144314.0 010 $a1-283-33977-3 010 $a9786613339775 010 $a1-4008-3959-9 024 7 $a10.1515/9781400839599 035 $a(CKB)2550000000066264 035 $a(EBL)802242 035 $a(OCoLC)768731903 035 $a(SSID)ssj0000551477 035 $a(PQKBManifestationID)11349891 035 $a(PQKBTitleCode)TC0000551477 035 $a(PQKBWorkID)10538185 035 $a(PQKB)10854955 035 $a(DE-B1597)447649 035 $a(OCoLC)922637566 035 $a(OCoLC)973401278 035 $a(DE-B1597)9781400839599 035 $a(Au-PeEL)EBL802242 035 $a(CaPaEBR)ebr10514781 035 $a(CaONFJC)MIL333977 035 $z(PPN)198685041 035 $a(PPN)187957819 035 $a(FR-PaCSA)88827140 035 $a(MiAaPQ)EBC802242 035 $a(EXLCZ)992550000000066264 100 $a20110826d2012 uy 0 101 0 $aeng 135 $aurunu||||| 181 $ctxt 182 $cc 183 $acr 200 10$aIn pursuit of the traveling salesman $emathematics at the limits of computation /$fWilliam J. Cook 205 $aCourse Book 210 $aPrinceton $cPrinceton University Press$d2012 215 $a1 online resource (245 p.) 300 $aDescription based upon print version of record. 311 $a0-691-16352-9 311 $a0-691-15270-5 320 $aIncludes bibliographical references and index. 327 $tFront matter --$tContents --$tPreface --$t1: Challenges --$t2: Origins of the Problem --$t3: The Salesman in Action --$t4: Searching for a Tour --$t5: Linear Programming --$t6: Cutting Planes --$t7: Branching --$t8: Big Computing --$t9: Complexity --$t10: The Human Touch --$t11: Aesthetics --$t12: Pushing the Limits --$tNotes --$tBibliography --$tIndex 330 $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. 606 $aTraveling salesman problem 606 $aComputational complexity 615 0$aTraveling salesman problem. 615 0$aComputational complexity. 676 $a511/.5 686 $aMAT000000$aMAT025000$2bisacsh 700 $aCook$b William$f1957-$0534905 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910817645403321 996 $aIn pursuit of the traveling salesman$93970731 997 $aUNINA