LEADER 00864nam0 22002411i 450 001 UON00025022 005 20231205102036.428 100 $a20020107d1987 |0itac50 ba 101 $akor 102 $aKR 105 $a|||| 1|||| 200 1 $aNampuk Hant'ong Ilron$fYu Sok Yol 210 $aSoeul$cPopmunsa$d1994 525 p. ; 23 cm 620 $aKR$dSeoul$3UONL000020 686 $aCOR IV$cCOREA - STORIA - PERIODO ANTICO$2A 700 1$aYU$bSok Yol$3UONV016671$0643006 712 $aPopmunsa$3UONV249944$4650 801 $aIT$bSOL$c20240220$gRICA 899 $aSIBA - SISTEMA BIBLIOTECARIO DI ATENEO$2UONSI 912 $aUON00025022 950 $aSIBA - SISTEMA BIBLIOTECARIO DI ATENEO$dSI COR IV 080 N $eSI SA 83484 5 080 N 996 $aNampuk Hant'ong Ilron$91201354 997 $aUNIOR LEADER 04099nam 2200757 a 450 001 9910973849703321 005 20200520144314.0 010 $a9786613339775 010 $a9781283339773 010 $a1283339773 010 $a9781400839599 010 $a1400839599 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(FRCYB88827140)88827140 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 08$a9780691163529 311 08$a0691163529 311 08$a9780691152707 311 08$a0691152705 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 $a9910973849703321 996 $aIn pursuit of the traveling salesman$94336652 997 $aUNINA