skip to content
In pursuit of the traveling salesman : mathematics at the limits of computation Preview this item
ClosePreview this item
Checking...

In pursuit of the traveling salesman : mathematics at the limits of computation

Author: William Cook
Publisher: Princeton : Princeton University Press, 2012.
Edition/Format:   eBook : Document : EnglishView all editions and formats
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  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Genre/Form: Electronic books
Additional Physical Format: Print version:
(DLC) 2011030626
Material Type: Document, Internet resource
Document Type: Internet Resource, Computer File
All Authors / Contributors: William Cook
ISBN: 9781400839599 1400839599 1283339773 9781283339773
OCLC Number: 774285465
Description: 1 online resource (xiii, 228 pages) : illustrations (some color), color maps
Contents: Challenges. Tour of the United States --
An impossible task? --
One problem at a time --
Road map of the book --
Origins of the problem. Before the mathematicians --
Euler and Hamilton --
Vienna to Harvard to Princeton --
And on to the RAND Corporation --
A statistical view --
The salesman in action. Road trips --
Mapping genomes --
Aiming telescopes, x-rays, and lasers --
Guiding industrial machines --
Organizing data --
Tests for microprocessors --
Scheduling jobs --
And more --
Searching for a tour. The 48-states problem --
Growing trees and tours --
Alterations while you wait --
Borrowing from physics and biology --
The DIMACS challenge --
Tour champions --
Linear programming. General-purpose model --
The simplex algorithm --
Two for the price of one: LP duality --
The degree LP relaxation of the TSP --
Eliminating subtours --
A perfect relaxation --
Integer programming --
Operations research --
Cutting planes. The cutting-plane method --
A catalog of TSP inequalities --
The separation problem --
Edmonds's glimpse of heaven --
Cutting planes for integer programming --
Branching. Breaking up --
The search party --
Branch-and-bound for integer programming --
Big computing. World records --
The TSP on a grand scale --
Complexity. A model of computation --
The campaign of Jack Edmonds --
Cook's theorem and Karp's list --
State of the TSP --
Do we need computers? --
The human touch. Humans versus computers --
Tour-finding strategies --
The TSP in neuroscience --
Animals solving the TSP --
Aesthetics --
Julian Lethbridge --
Jordan curves --
Continuous lines --
Art and mathematics --
Pushing the limits.
Responsibility: William J. Cook.

Abstract:

What is the shortest possible route for a travelling salesman seeking to visit each city on a list exactly once and return to his city of origin? This book examines the origins and history of the  Read more...

Reviews

Editorial reviews

Publisher Synopsis

"Fascinating ... describes the history, personalities, challenges, applications and techniques used to find solutions of the famous 'Traveling Salesman Problem' and related problems."--Pradeep Read more...

 
User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


Primary Entity

<http://www.worldcat.org/oclc/774285465> # In pursuit of the traveling salesman : mathematics at the limits of computation
    a schema:CreativeWork, schema:MediaObject, schema:Book ;
    library:oclcnum "774285465" ;
    library:placeOfPublication <http://id.loc.gov/vocabulary/countries/nju> ;
    library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/1076060341#Place/princeton> ; # Princeton
    schema:about <http://dewey.info/class/511.5/e23/> ;
    schema:about <http://id.worldcat.org/fast/1155795> ; # Traveling salesman problem
    schema:about <http://experiment.worldcat.org/entity/work/data/1076060341#Topic/mathematics_general> ; # MATHEMATICS--General
    schema:about <http://experiment.worldcat.org/entity/work/data/1076060341#Topic/mathematics_graphic_methods> ; # MATHEMATICS--Graphic Methods
    schema:about <http://id.worldcat.org/fast/871991> ; # Computational complexity
    schema:author <http://viaf.org/viaf/268835759> ; # William Cook
    schema:bookFormat schema:EBook ;
    schema:datePublished "2012" ;
    schema:description ""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"--"@en ;
    schema:description "Challenges. Tour of the United States -- An impossible task? -- One problem at a time -- Road map of the book -- Origins of the problem. Before the mathematicians -- Euler and Hamilton -- Vienna to Harvard to Princeton -- And on to the RAND Corporation -- A statistical view -- The salesman in action. Road trips -- Mapping genomes -- Aiming telescopes, x-rays, and lasers -- Guiding industrial machines -- Organizing data -- Tests for microprocessors -- Scheduling jobs -- And more -- Searching for a tour. The 48-states problem -- Growing trees and tours -- Alterations while you wait -- Borrowing from physics and biology -- The DIMACS challenge -- Tour champions -- Linear programming. General-purpose model -- The simplex algorithm -- Two for the price of one: LP duality -- The degree LP relaxation of the TSP -- Eliminating subtours -- A perfect relaxation -- Integer programming -- Operations research -- Cutting planes. The cutting-plane method -- A catalog of TSP inequalities -- The separation problem -- Edmonds's glimpse of heaven -- Cutting planes for integer programming -- Branching. Breaking up -- The search party -- Branch-and-bound for integer programming -- Big computing. World records -- The TSP on a grand scale -- Complexity. A model of computation -- The campaign of Jack Edmonds -- Cook's theorem and Karp's list -- State of the TSP -- Do we need computers? -- The human touch. Humans versus computers -- Tour-finding strategies -- The TSP in neuroscience -- Animals solving the TSP -- Aesthetics -- Julian Lethbridge -- Jordan curves -- Continuous lines -- Art and mathematics -- Pushing the limits."@en ;
    schema:exampleOfWork <http://worldcat.org/entity/work/id/1076060341> ;
    schema:genre "Electronic books"@en ;
    schema:inLanguage "en" ;
    schema:isSimilarTo <http://worldcat.org/entity/work/data/1076060341#CreativeWork/> ;
    schema:name "In pursuit of the traveling salesman : mathematics at the limits of computation"@en ;
    schema:productID "774285465" ;
    schema:publication <http://www.worldcat.org/title/-/oclc/774285465#PublicationEvent/princeton_princeton_university_press_2012> ;
    schema:publisher <http://experiment.worldcat.org/entity/work/data/1076060341#Agent/princeton_university_press> ; # Princeton University Press
    schema:url <http://site.ebrary.com/id/10514781> ;
    schema:url <http://www.myilibrary.com?id=333977> ;
    schema:url <http://public.eblib.com/choice/publicfullrecord.aspx?p=802242> ;
    schema:url <https://grinnell.idm.oclc.org/login?url=http://www.jstor.org/stable/10.2307/j.ctt7t8kc> ;
    schema:url <http://dx.doi.org/10.1515/9781400839599> ;
    schema:url <http://ebookcentral.proquest.com/lib/warw/detail.action?docID=802242> ;
    schema:url <http://www.degruyter.com/search?f_0=isbnissn&q_0=9781400839599&searchTitles=true> ;
    schema:url <http://www.myilibrary.com?id=333977&ref=toc> ;
    schema:url <http://er.llcc.edu:2048/login?url=http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=408430> ;
    schema:url <http://proquest.tech.safaribooksonline.de/9780691152707> ;
    schema:url <http://proquest.safaribooksonline.com/9780691152707> ;
    schema:url <http://ebookcentral.proquest.com/lib/columbia/detail.action?docID=802242> ;
    schema:url <http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=408430> ;
    schema:url <http://www.jstor.org/stable/10.2307/j.ctt7t8kc> ;
    schema:url <http://public.ebookcentral.proquest.com/choice/publicfullrecord.aspx?p=802242> ;
    schema:url <http://site.ebrary.com/id/10514781&p00> ;
    schema:workExample <http://worldcat.org/isbn/9781400839599> ;
    schema:workExample <http://worldcat.org/isbn/9781283339773> ;
    wdrs:describedby <http://www.worldcat.org/title/-/oclc/774285465> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/1076060341#Agent/princeton_university_press> # Princeton University Press
    a bgn:Agent ;
    schema:name "Princeton University Press" ;
    .

<http://experiment.worldcat.org/entity/work/data/1076060341#Topic/mathematics_general> # MATHEMATICS--General
    a schema:Intangible ;
    schema:name "MATHEMATICS--General"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/1076060341#Topic/mathematics_graphic_methods> # MATHEMATICS--Graphic Methods
    a schema:Intangible ;
    schema:name "MATHEMATICS--Graphic Methods"@en ;
    .

<http://id.worldcat.org/fast/1155795> # Traveling salesman problem
    a schema:Intangible ;
    schema:name "Traveling salesman problem"@en ;
    .

<http://id.worldcat.org/fast/871991> # Computational complexity
    a schema:Intangible ;
    schema:name "Computational complexity"@en ;
    .

<http://viaf.org/viaf/268835759> # William Cook
    a schema:Person ;
    schema:birthDate "1957" ;
    schema:familyName "Cook" ;
    schema:givenName "William" ;
    schema:name "William Cook" ;
    .

<http://worldcat.org/entity/work/data/1076060341#CreativeWork/>
    a schema:CreativeWork ;
    schema:description "Print version:" ;
    schema:isSimilarTo <http://www.worldcat.org/oclc/774285465> ; # In pursuit of the traveling salesman : mathematics at the limits of computation
    .

<http://worldcat.org/isbn/9781283339773>
    a schema:ProductModel ;
    schema:isbn "1283339773" ;
    schema:isbn "9781283339773" ;
    .

<http://worldcat.org/isbn/9781400839599>
    a schema:ProductModel ;
    schema:isbn "1400839599" ;
    schema:isbn "9781400839599" ;
    .

<http://www.worldcat.org/title/-/oclc/774285465>
    a genont:InformationResource, genont:ContentTypeGenericResource ;
    schema:about <http://www.worldcat.org/oclc/774285465> ; # In pursuit of the traveling salesman : mathematics at the limits of computation
    schema:dateModified "2018-01-05" ;
    void:inDataset <http://purl.oclc.org/dataset/WorldCat> ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.