In pursuit of the traveling salesman : | mathematics at the limits of computation / (Record no. 103907)

MARC details
000 -LEADER
fixed length control field 02481cam a22002414a 4500
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 110826s2012 njuab b 001 0 eng
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9780691152707
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 0691152705
040 ## - CATALOGING SOURCE
Original cataloging agency SDU
050 00 - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA164
Item number C771 I 2012
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Cook, William,
245 10 - TITLE STATEMENT
Title In pursuit of the traveling salesman :
Remainder of title mathematics at the limits of computation /
Statement of responsibility, etc. William J. Cook.
260 ## - PUBLICATION, DISTRIBUTION, ETC.
Place of publication, distribution, etc. Princeton, N.J. :
Name of publisher, distributor, etc. Princeton University Press,
Date of publication, distribution, etc. 2012.
300 ## - PHYSICAL DESCRIPTION
Extent 228 p. :
Other physical details ill.
505 ## - Formatted Contents Note
Formatted contents note HKBU library
518 ## - DATE/TIME AND PLACE OF AN EVENT NOTE
DATE/TIME AND PLACE OF AN EVENT NOTE YT2025 M10
520 ## - SUMMARY
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.
520 ## - SUMMARY
Summary "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.
650 #0 - SUBJECT
Topical term Traveling salesman problem.
650 #0 - SUBJECT
Topical term Computational complexity.
900 ## - Accession Number
Accession Number = C.1 SDU
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type English Books
Source of classification or shelving scheme Library of Congress Classification
100 1# - MAIN ENTRY--PERSONAL NAME
-- 192981
650 #0 - SUBJECT
-- 192982
650 #0 - SUBJECT
-- 179563
Holdings
Withdrawn status Lost status Source of classification or shelving scheme Damaged status Not for loan Collection code Home library Current library Shelving location Date acquired Source of acquisition Total Checkouts Full call number Barcode Date last seen Copy number Price effective from Koha item type
    Library of Congress Classification   Available for Loans General Books MATRIX Library MATRIX Library General Eng/FL.3 16/10/2025 Donation   QA164 C771 I 2012 1000385137 16/10/2025 C.1 16/10/2025 English Books
คัดลอกแล้ว!