Item Details

Print View

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 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.
"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.
Description
Mode of access: World wide Web.
Notes
Includes bibliographical references (p. [223]-224) and index.
Copyright Not EvaluatedCopyright Not Evaluated
Technical Details
  • Access in Virgo Classic
  • Staff View

    LEADER 03113cam a22003854a 4500
    001 u6164461
    003 SIRSI
    005 20170308061700.0
    006 m d
    007 cr n
    008 110826s2012 njuab sb 001 0 eng d
    010
      
      
    a| 2011030626
    016
    7
      
    a| 015879100 2| Uk
    020
      
      
    a| 9780691152707 (alk. paper)
    020
      
      
    a| 0691152705 (alk. paper)
    035
      
      
    a| (WaSeSS)ssj0000551477
    040
      
      
    a| DLC c| DLC d| YDX d| BTCTA d| UKMGB d| PUL d| YDXCP d| BWX d| DLC d| WaSeSS
    042
      
      
    a| pcc
    050
    0
    0
    a| QA164 b| .C69 2012
    082
    0
    0
    a| 511/.5 2| 23
    084
      
      
    a| MAT000000 a| MAT025000 2| bisacsh
    100
    1
      
    a| Cook, William, d| 1957-
    245
    1
    0
    a| In pursuit of the traveling salesman h| [electronic resource] : b| mathematics at the limits of computation / c| William J. Cook.
    260
      
      
    a| Princeton, N.J. : b| Princeton University Press, c| c2012.
    504
      
      
    a| Includes 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.
    538
      
      
    a| Mode of access: World wide Web.
    650
      
    0
    a| Traveling salesman problem.
    650
      
    0
    a| Computational complexity.
    655
      
    0
    a| Electronic books.
    710
    2
      
    a| Safari Books Online
    856
    4
    0
    u| http://RE5QY4SB7X.search.serialssolutions.com/?V=1.0&L=RE5QY4SB7X&S=JCs&C=TC0000551477&T=marc
    596
      
      
    a| 1
    999
      
      
    a| XX(6164461.1) w| WEB i| 6164461-1001 l| INTERNET m| UVA-LIB t| INTERNET
▾See more
▴See less

Availability

Google Preview

Google Books Preview

Read Online