HjemGrupperSnakMereZeitgeist
Søg På Websted
På dette site bruger vi cookies til at levere vores ydelser, forbedre performance, til analyseformål, og (hvis brugeren ikke er logget ind) til reklamer. Ved at bruge LibraryThing anerkender du at have læst og forstået vores vilkår og betingelser inklusive vores politik for håndtering af brugeroplysninger. Din brug af dette site og dets ydelser er underlagt disse vilkår og betingelser.

Resultater fra Google Bøger

Klik på en miniature for at gå til Google Books

Indlæser...

In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation

af William J. Cook

MedlemmerAnmeldelserPopularitetGennemsnitlig vurderingOmtaler
95Ingen283,304 (3.9)1
"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"--… (mere)
Indlæser...

Bliv medlem af LibraryThing for at finde ud af, om du vil kunne lide denne bog.

Der er ingen diskussionstråde på Snak om denne bog.

» See also 1 mention

Ingen anmeldelser
ingen anmeldelser | tilføj en anmeldelse
Du bliver nødt til at logge ind for at redigere data i Almen Viden.
For mere hjælp se Almen Viden hjælpesiden.
Kanonisk titel
Originaltitel
Alternative titler
Oprindelig udgivelsesdato
Personer/Figurer
Vigtige steder
Vigtige begivenheder
Beslægtede film
Indskrift
Tilegnelse
Første ord
Citater
Sidste ord
Oplysning om flertydighed
Forlagets redaktører
Bagsidecitater
Originalsprog
Canonical DDC/MDS
Canonical LCC

Henvisninger til dette værk andre steder.

Wikipedia på engelsk

Ingen

"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"--

No library descriptions found.

Beskrivelse af bogen
Haiku-resume

Current Discussions

Ingen

Populære omslag

Quick Links

Vurdering

Gennemsnit: (3.9)
0.5
1
1.5
2 1
2.5
3 2
3.5
4 4
4.5
5 3

Er det dig?

Bliv LibraryThing-forfatter.

 

Om | Kontakt | LibraryThing.com | Brugerbetingelser/Håndtering af brugeroplysninger | Hjælp/FAQs | Blog | Butik | APIs | TinyCat | Efterladte biblioteker | Tidlige Anmeldere | Almen Viden | 203,251,506 bøger! | Topbjælke: Altid synlig