In pursuit of the traveling salesman: mathematics at the limits of computation
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Princeton
Princeton University Press
2012
|
| Schlagworte: | |
| Online-Zugang: | DE-1046 DE-1047 Volltext |
| Beschreibung: | Includes bibliographical references and index "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"-- 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 |
| Beschreibung: | 1 Online-Ressource (xiii, 228 p.) |
| ISBN: | 0691152705 1400839599 9780691152707 9781400839599 |
Internformat
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV043168469 | ||
| 003 | DE-604 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 151126s2012 xx o|||| 00||| eng d | ||
| 020 | |a 0691152705 |9 0-691-15270-5 | ||
| 020 | |a 1400839599 |c electronic bk. |9 1-4008-3959-9 | ||
| 020 | |a 9780691152707 |9 978-0-691-15270-7 | ||
| 020 | |a 9781400839599 |c electronic bk. |9 978-1-4008-3959-9 | ||
| 035 | |a (OCoLC)774285465 | ||
| 035 | |a (DE-599)BVBBV043168469 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-1046 |a DE-1047 | ||
| 082 | 0 | |a 511/.5 |2 23 | |
| 100 | 1 | |a Cook, William |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a In pursuit of the traveling salesman |b mathematics at the limits of computation |c William J. Cook |
| 264 | 1 | |a Princeton |b Princeton University Press |c 2012 | |
| 300 | |a 1 Online-Ressource (xiii, 228 p.) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 500 | |a Includes bibliographical references and index | ||
| 500 | |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"-- | ||
| 500 | |a 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 | ||
| 648 | 7 | |a Geschichte |2 gnd |9 rswk-swf | |
| 650 | 7 | |a MATHEMATICS / Graphic Methods |2 bisacsh | |
| 650 | 7 | |a MATHEMATICS / General |2 bisacsh | |
| 650 | 7 | |a Computational complexity |2 fast | |
| 650 | 7 | |a Traveling salesman problem |2 fast | |
| 650 | 7 | |a Traveling salesman problem |2 local | |
| 650 | 7 | |a Computational complexity |2 local | |
| 650 | 4 | |a Traveling salesman problem | |
| 650 | 4 | |a Computational complexity | |
| 650 | 0 | 7 | |a Travelling-salesman-Problem |0 (DE-588)4185966-2 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Travelling-salesman-Problem |0 (DE-588)4185966-2 |D s |
| 689 | 0 | 1 | |a Geschichte |A z |
| 689 | 0 | |5 DE-604 | |
| 856 | 4 | 0 | |u http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=408430 |x Aggregator |3 Volltext |
| 912 | |a ZDB-4-EBA | ||
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-028592660 | |
| 966 | e | |u http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=408430 |l DE-1046 |p ZDB-4-EBA |q FAW_PDA_EBA |x Aggregator |3 Volltext | |
| 966 | e | |u http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=408430 |l DE-1047 |p ZDB-4-EBA |q FAW_PDA_EBA |x Aggregator |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1824627632994516992 |
|---|---|
| adam_text | |
| any_adam_object | |
| author | Cook, William |
| author_facet | Cook, William |
| author_role | aut |
| author_sort | Cook, William |
| author_variant | w c wc |
| building | Verbundindex |
| bvnumber | BV043168469 |
| collection | ZDB-4-EBA |
| ctrlnum | (OCoLC)774285465 (DE-599)BVBBV043168469 |
| dewey-full | 511/.5 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511/.5 |
| dewey-search | 511/.5 |
| dewey-sort | 3511 15 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| era | Geschichte gnd |
| era_facet | Geschichte |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000zc 4500</leader><controlfield tag="001">BV043168469</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">151126s2012 xx o|||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0691152705</subfield><subfield code="9">0-691-15270-5</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1400839599</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">1-4008-3959-9</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780691152707</subfield><subfield code="9">978-0-691-15270-7</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781400839599</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">978-1-4008-3959-9</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)774285465</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV043168469</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-1046</subfield><subfield code="a">DE-1047</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511/.5</subfield><subfield code="2">23</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Cook, William</subfield><subfield code="e">Verfasser</subfield><subfield code="4">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="264" ind1=" " ind2="1"><subfield code="a">Princeton</subfield><subfield code="b">Princeton University Press</subfield><subfield code="c">2012</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (xiii, 228 p.)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references and index</subfield></datafield><datafield tag="500" 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. 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"--</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">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</subfield></datafield><datafield tag="648" ind1=" " ind2="7"><subfield code="a">Geschichte</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS / Graphic Methods</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS / General</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computational complexity</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Traveling salesman problem</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Traveling salesman problem</subfield><subfield code="2">local</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computational complexity</subfield><subfield code="2">local</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Traveling salesman problem</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Travelling-salesman-Problem</subfield><subfield code="0">(DE-588)4185966-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Travelling-salesman-Problem</subfield><subfield code="0">(DE-588)4185966-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Geschichte</subfield><subfield code="A">z</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=408430</subfield><subfield code="x">Aggregator</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-4-EBA</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-028592660</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=408430</subfield><subfield code="l">DE-1046</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FAW_PDA_EBA</subfield><subfield code="x">Aggregator</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=408430</subfield><subfield code="l">DE-1047</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FAW_PDA_EBA</subfield><subfield code="x">Aggregator</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV043168469 |
| illustrated | Not Illustrated |
| indexdate | 2025-02-21T01:15:10Z |
| institution | BVB |
| isbn | 0691152705 1400839599 9780691152707 9781400839599 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-028592660 |
| oclc_num | 774285465 |
| open_access_boolean | |
| owner | DE-1046 DE-1047 |
| owner_facet | DE-1046 DE-1047 |
| physical | 1 Online-Ressource (xiii, 228 p.) |
| psigel | ZDB-4-EBA ZDB-4-EBA FAW_PDA_EBA |
| publishDate | 2012 |
| publishDateSearch | 2012 |
| publishDateSort | 2012 |
| publisher | Princeton University Press |
| record_format | marc |
| spelling | Cook, William Verfasser aut In pursuit of the traveling salesman mathematics at the limits of computation William J. Cook Princeton Princeton University Press 2012 1 Online-Ressource (xiii, 228 p.) txt rdacontent c rdamedia cr rdacarrier Includes bibliographical references and index "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"-- 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 Geschichte gnd rswk-swf MATHEMATICS / Graphic Methods bisacsh MATHEMATICS / General bisacsh Computational complexity fast Traveling salesman problem fast Traveling salesman problem local Computational complexity local Traveling salesman problem Computational complexity Travelling-salesman-Problem (DE-588)4185966-2 gnd rswk-swf Travelling-salesman-Problem (DE-588)4185966-2 s Geschichte z DE-604 http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=408430 Aggregator Volltext |
| spellingShingle | Cook, William In pursuit of the traveling salesman mathematics at the limits of computation MATHEMATICS / Graphic Methods bisacsh MATHEMATICS / General bisacsh Computational complexity fast Traveling salesman problem fast Traveling salesman problem local Computational complexity local Traveling salesman problem Computational complexity Travelling-salesman-Problem (DE-588)4185966-2 gnd |
| subject_GND | (DE-588)4185966-2 |
| title | In pursuit of the traveling salesman mathematics at the limits of computation |
| title_auth | In pursuit of the traveling salesman mathematics at the limits of computation |
| title_exact_search | In pursuit of the traveling salesman 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_short | In pursuit of the traveling salesman |
| title_sort | in pursuit of the traveling salesman mathematics at the limits of computation |
| title_sub | mathematics at the limits of computation |
| topic | MATHEMATICS / Graphic Methods bisacsh MATHEMATICS / General bisacsh Computational complexity fast Traveling salesman problem fast Traveling salesman problem local Computational complexity local Traveling salesman problem Computational complexity Travelling-salesman-Problem (DE-588)4185966-2 gnd |
| topic_facet | MATHEMATICS / Graphic Methods MATHEMATICS / General Computational complexity Traveling salesman problem Travelling-salesman-Problem |
| url | http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=408430 |
| work_keys_str_mv | AT cookwilliam inpursuitofthetravelingsalesmanmathematicsatthelimitsofcomputation |