In Pursuit of the Traveling Salesman : : Mathematics at the Limits of Computation / / William J. Cook.
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...
Saved in:
Superior document: | Title is part of eBook package: De Gruyter Princeton University Press eBook-Package Backlist 2000-2013 |
---|---|
VerfasserIn: | |
Place / Publishing House: | Princeton, NJ : : Princeton University Press, , [2011] ©2012 |
Year of Publication: | 2011 |
Edition: | Course Book |
Language: | English |
Online Access: | |
Physical Description: | 1 online resource (248 p.) :; 113 color illus. 19 halftones. 19 line illus. 2 tables. |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
id |
9781400839599 |
---|---|
ctrlnum |
(DE-B1597)447649 (OCoLC)922637566 |
collection |
bib_alma |
record_format |
marc |
spelling |
Cook, William J., author. aut http://id.loc.gov/vocabulary/relators/aut In Pursuit of the Traveling Salesman : Mathematics at the Limits of Computation / William J. Cook. Course Book Princeton, NJ : Princeton University Press, [2011] ©2012 1 online resource (248 p.) : 113 color illus. 19 halftones. 19 line illus. 2 tables. text txt rdacontent computer c rdamedia online resource cr rdacarrier text file PDF rda Frontmatter -- Contents -- Preface -- 1: Challenges -- 2: Origins of the Problem -- 3: The Salesman in Action -- 4: Searching for a Tour -- 5: Linear Programming -- 6: Cutting Planes -- 7: Branching -- 8: Big Computing -- 9: Complexity -- 10: The Human Touch -- 11: Aesthetics -- 12: Pushing the Limits -- Notes -- Bibliography -- Index restricted access http://purl.org/coar/access_right/c_16ec online access with authorization star 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. He also explores its many important applications, from genome sequencing and designing computer processors to arranging music and hunting for planets.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.Some images inside the book are unavailable due to digital copyright restrictions. Issued also in print. Mode of access: Internet via World Wide Web. In English. Description based on online resource; title from PDF title page (publisher's Web site, viewed 30. Aug 2021) Computational complexity. MATHEMATICS Graphic Methods. Mathematics Graphic methods. Traveling salesman problem. MATHEMATICS / General. bisacsh Title is part of eBook package: De Gruyter Princeton University Press eBook-Package Backlist 2000-2013 9783110442502 print 9780691152707 https://doi.org/10.1515/9781400839599 https://www.degruyter.com/isbn/9781400839599 Cover https://www.degruyter.com/cover/covers/9781400839599.jpg |
language |
English |
format |
eBook |
author |
Cook, William J., Cook, William J., |
spellingShingle |
Cook, William J., Cook, William J., In Pursuit of the Traveling Salesman : Mathematics at the Limits of Computation / Frontmatter -- Contents -- Preface -- 1: Challenges -- 2: Origins of the Problem -- 3: The Salesman in Action -- 4: Searching for a Tour -- 5: Linear Programming -- 6: Cutting Planes -- 7: Branching -- 8: Big Computing -- 9: Complexity -- 10: The Human Touch -- 11: Aesthetics -- 12: Pushing the Limits -- Notes -- Bibliography -- Index |
author_facet |
Cook, William J., Cook, William J., |
author_variant |
w j c wj wjc w j c wj wjc |
author_role |
VerfasserIn VerfasserIn |
author_sort |
Cook, William J., |
title |
In Pursuit of the Traveling Salesman : Mathematics at the Limits of Computation / |
title_sub |
Mathematics at the Limits of Computation / |
title_full |
In Pursuit of the Traveling Salesman : Mathematics at the Limits of Computation / William J. Cook. |
title_fullStr |
In Pursuit of the Traveling Salesman : Mathematics at the Limits of Computation / William J. Cook. |
title_full_unstemmed |
In Pursuit of the Traveling Salesman : Mathematics at the Limits of Computation / William J. Cook. |
title_auth |
In Pursuit of the Traveling Salesman : Mathematics at the Limits of Computation / |
title_alt |
Frontmatter -- Contents -- Preface -- 1: Challenges -- 2: Origins of the Problem -- 3: The Salesman in Action -- 4: Searching for a Tour -- 5: Linear Programming -- 6: Cutting Planes -- 7: Branching -- 8: Big Computing -- 9: Complexity -- 10: The Human Touch -- 11: Aesthetics -- 12: Pushing the Limits -- Notes -- Bibliography -- Index |
title_new |
In Pursuit of the Traveling Salesman : |
title_sort |
in pursuit of the traveling salesman : mathematics at the limits of computation / |
publisher |
Princeton University Press, |
publishDate |
2011 |
physical |
1 online resource (248 p.) : 113 color illus. 19 halftones. 19 line illus. 2 tables. Issued also in print. |
edition |
Course Book |
contents |
Frontmatter -- Contents -- Preface -- 1: Challenges -- 2: Origins of the Problem -- 3: The Salesman in Action -- 4: Searching for a Tour -- 5: Linear Programming -- 6: Cutting Planes -- 7: Branching -- 8: Big Computing -- 9: Complexity -- 10: The Human Touch -- 11: Aesthetics -- 12: Pushing the Limits -- Notes -- Bibliography -- Index |
isbn |
9781400839599 9783110442502 9780691152707 |
callnumber-first |
Q - Science |
callnumber-subject |
QA - Mathematics |
callnumber-label |
QA164 |
callnumber-sort |
QA 3164 |
url |
https://doi.org/10.1515/9781400839599 https://www.degruyter.com/isbn/9781400839599 https://www.degruyter.com/cover/covers/9781400839599.jpg |
illustrated |
Illustrated |
dewey-hundreds |
500 - Science |
dewey-tens |
510 - Mathematics |
dewey-ones |
511 - General principles of mathematics |
dewey-full |
511/.5 |
dewey-sort |
3511 15 |
dewey-raw |
511/.5 |
dewey-search |
511/.5 |
doi_str_mv |
10.1515/9781400839599 |
oclc_num |
922637566 |
work_keys_str_mv |
AT cookwilliamj inpursuitofthetravelingsalesmanmathematicsatthelimitsofcomputation |
status_str |
n |
ids_txt_mv |
(DE-B1597)447649 (OCoLC)922637566 |
carrierType_str_mv |
cr |
hierarchy_parent_title |
Title is part of eBook package: De Gruyter Princeton University Press eBook-Package Backlist 2000-2013 |
is_hierarchy_title |
In Pursuit of the Traveling Salesman : Mathematics at the Limits of Computation / |
container_title |
Title is part of eBook package: De Gruyter Princeton University Press eBook-Package Backlist 2000-2013 |
_version_ |
1770176666651328512 |
fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>04039nam a22007335i 4500</leader><controlfield tag="001">9781400839599</controlfield><controlfield tag="003">DE-B1597</controlfield><controlfield tag="005">20210830012106.0</controlfield><controlfield tag="006">m|||||o||d||||||||</controlfield><controlfield tag="007">cr || ||||||||</controlfield><controlfield tag="008">210830t20112012nju fo d z eng d</controlfield><datafield tag="019" ind1=" " ind2=" "><subfield code="a">(OCoLC)973401278</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781400839599</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1515/9781400839599</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-B1597)447649</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)922637566</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-B1597</subfield><subfield code="b">eng</subfield><subfield code="c">DE-B1597</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">nju</subfield><subfield code="c">US-NJ</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA164</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">MAT000000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">511/.5</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Cook, William J., </subfield><subfield code="e">author.</subfield><subfield code="4">aut</subfield><subfield code="4">http://id.loc.gov/vocabulary/relators/aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">In Pursuit of the Traveling Salesman :</subfield><subfield code="b">Mathematics at the Limits of Computation /</subfield><subfield code="c">William J. Cook.</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">Course Book</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Princeton, NJ : </subfield><subfield code="b">Princeton University Press, </subfield><subfield code="c">[2011]</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">©2012</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (248 p.) :</subfield><subfield code="b">113 color illus. 19 halftones. 19 line illus. 2 tables.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="347" ind1=" " ind2=" "><subfield code="a">text file</subfield><subfield code="b">PDF</subfield><subfield code="2">rda</subfield></datafield><datafield tag="505" ind1="0" ind2="0"><subfield code="t">Frontmatter -- </subfield><subfield code="t">Contents -- </subfield><subfield code="t">Preface -- </subfield><subfield code="t">1: Challenges -- </subfield><subfield code="t">2: Origins of the Problem -- </subfield><subfield code="t">3: The Salesman in Action -- </subfield><subfield code="t">4: Searching for a Tour -- </subfield><subfield code="t">5: Linear Programming -- </subfield><subfield code="t">6: Cutting Planes -- </subfield><subfield code="t">7: Branching -- </subfield><subfield code="t">8: Big Computing -- </subfield><subfield code="t">9: Complexity -- </subfield><subfield code="t">10: The Human Touch -- </subfield><subfield code="t">11: Aesthetics -- </subfield><subfield code="t">12: Pushing the Limits -- </subfield><subfield code="t">Notes -- </subfield><subfield code="t">Bibliography -- </subfield><subfield code="t">Index</subfield></datafield><datafield tag="506" ind1="0" ind2=" "><subfield code="a">restricted access</subfield><subfield code="u">http://purl.org/coar/access_right/c_16ec</subfield><subfield code="f">online access with authorization</subfield><subfield code="2">star</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="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. He also explores its many important applications, from genome sequencing and designing computer processors to arranging music and hunting for planets.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.Some images inside the book are unavailable due to digital copyright restrictions.</subfield></datafield><datafield tag="530" ind1=" " ind2=" "><subfield code="a">Issued also in print.</subfield></datafield><datafield tag="538" ind1=" " ind2=" "><subfield code="a">Mode of access: Internet via World Wide Web.</subfield></datafield><datafield tag="546" ind1=" " ind2=" "><subfield code="a">In English.</subfield></datafield><datafield tag="588" ind1="0" ind2=" "><subfield code="a">Description based on online resource; title from PDF title page (publisher's Web site, viewed 30. Aug 2021)</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Computational complexity.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">MATHEMATICS</subfield><subfield code="x">Graphic Methods.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Mathematics</subfield><subfield code="x">Graphic methods.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Traveling salesman problem.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS / General.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Title is part of eBook package:</subfield><subfield code="d">De Gruyter</subfield><subfield code="t">Princeton University Press eBook-Package Backlist 2000-2013</subfield><subfield code="z">9783110442502</subfield></datafield><datafield tag="776" ind1="0" ind2=" "><subfield code="c">print</subfield><subfield code="z">9780691152707</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1515/9781400839599</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://www.degruyter.com/isbn/9781400839599</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="3">Cover</subfield><subfield code="u">https://www.degruyter.com/cover/covers/9781400839599.jpg</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">978-3-11-044250-2 Princeton University Press eBook-Package Backlist 2000-2013</subfield><subfield code="c">2000</subfield><subfield code="d">2013</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_BACKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_CL_MTPY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_EBACKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_EBKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_ECL_MTPY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_EEBKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_ESTMALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_PPALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_STMALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV-deGruyter-alles</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA12STME</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA13ENGE</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA18STMEE</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA5EBK</subfield></datafield></record></collection> |