The Traveling Salesman problem: a computational study
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Princeton, N.J.
Princeton University Press
2011
|
| Schriftenreihe: | Princeton series in applied mathematics
|
| Schlagworte: | |
| Online-Zugang: | TUM01 UER01 Volltext Volltext |
| Beschreibung: | Biographical note: David L. Applegate is a researcher at AT&T Labs. Robert E. Bixby is Research Professor of Management and Noah Harding Professor of Computational and Applied Mathematics at Rice University. Vasek Chvátal is Canada Research Chair in Combinatorial Optimization at Concordia University. William J. Cook is Chandler Family Chair in Industrial and Systems Engineering at the Georgia Institute of Technology Main description: This book presents the latest findings on one of the most intensely investigated subjects in computational mathematics--the traveling salesman problem. It sounds simple enough: given a set of cities and the cost of travel between each pair of them, the problem challenges you to find the cheapest route by which to visit all the cities and return home to where you began. Though seemingly modest, this exercise has inspired studies by mathematicians, chemists, and physicists. Teachers use it in the classroom. It has practical applications in genetics, telecommunications, and neuroscience. The authors of this book are the same pioneers who for nearly two decades have led the investigation into the traveling salesman problem. They have derived solutions to almost eighty-six thousand cities, yet a general solution to the problem has yet to be discovered. Here they describe the method and computer code they used to solve a broad range of large-scale problems, and along the way they demonstrate the interplay of applied mathematics with increasingly powerful computing platforms. They also give the fascinating history of the problem--how it developed, and why it continues to intrigue us |
| Beschreibung: | 1 Online-Ressource (608 S.) |
| ISBN: | 9781400841103 |
Internformat
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV042522946 | ||
| 003 | DE-604 | ||
| 005 | 20210210 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 150423s2011 |||| o||u| ||||||eng d | ||
| 020 | |a 9781400841103 |9 978-1-4008-4110-3 | ||
| 024 | 7 | |a 10.1515/9781400841103 |2 doi | |
| 035 | |a (OCoLC)910032142 | ||
| 035 | |a (DE-599)BVBBV042522946 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29 |a DE-91 | ||
| 082 | 0 | |a 511.6 | |
| 084 | |a MAT 908 |2 stub | ||
| 100 | 1 | |a Applegate, David L. |e Verfasser |0 (DE-588)1089639260 |4 aut | |
| 245 | 1 | 0 | |a The Traveling Salesman problem |b a computational study |c David L. Applegate, Robert E. Bixby, Vašek Chvátal, und William J. Cook |
| 264 | 1 | |a Princeton, N.J. |b Princeton University Press |c 2011 | |
| 300 | |a 1 Online-Ressource (608 S.) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Princeton series in applied mathematics | |
| 500 | |a Biographical note: David L. Applegate is a researcher at AT&T Labs. Robert E. Bixby is Research Professor of Management and Noah Harding Professor of Computational and Applied Mathematics at Rice University. Vasek Chvátal is Canada Research Chair in Combinatorial Optimization at Concordia University. William J. Cook is Chandler Family Chair in Industrial and Systems Engineering at the Georgia Institute of Technology | ||
| 500 | |a Main description: This book presents the latest findings on one of the most intensely investigated subjects in computational mathematics--the traveling salesman problem. It sounds simple enough: given a set of cities and the cost of travel between each pair of them, the problem challenges you to find the cheapest route by which to visit all the cities and return home to where you began. Though seemingly modest, this exercise has inspired studies by mathematicians, chemists, and physicists. Teachers use it in the classroom. It has practical applications in genetics, telecommunications, and neuroscience. The authors of this book are the same pioneers who for nearly two decades have led the investigation into the traveling salesman problem. They have derived solutions to almost eighty-six thousand cities, yet a general solution to the problem has yet to be discovered. Here they describe the method and computer code they used to solve a broad range of large-scale problems, and along the way they demonstrate the interplay of applied mathematics with increasingly powerful computing platforms. They also give the fascinating history of the problem--how it developed, and why it continues to intrigue us | ||
| 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 | |5 DE-604 | |
| 700 | 1 | |a Bixby, Robert E. |e Verfasser |0 (DE-588)170305279 |4 aut | |
| 700 | 1 | |a Chvátal, Vašek |d 1946- |e Verfasser |0 (DE-588)110721772 |4 aut | |
| 700 | 1 | |a Cook, William |d 1957- |e Verfasser |0 (DE-588)172025265 |4 aut | |
| 856 | 4 | 0 | |u http://www.degruyter.com/doi/book/10.1515/9781400841103 |x Verlag |3 Volltext |
| 856 | 4 | 0 | |u http://www.degruyter.com/search?f_0=isbnissn&q_0=9781400841103&searchTitles=true |x Verlag |3 Volltext |
| 912 | |a ZDB-23-DGG | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-027957285 | ||
| 966 | e | |u https://doi.org/10.1515/9781400841103?locatt=mode:legacy |l TUM01 |p ZDB-23-DGG |q TUM_Einzelkauf |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1515/9781400841103?locatt=mode:legacy |l UER01 |p ZDB-23-DGG |q UER_PDA_DGG_Kauf |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804153276273262592 |
|---|---|
| any_adam_object | |
| author | Applegate, David L. Bixby, Robert E. Chvátal, Vašek 1946- Cook, William 1957- |
| author_GND | (DE-588)1089639260 (DE-588)170305279 (DE-588)110721772 (DE-588)172025265 |
| author_facet | Applegate, David L. Bixby, Robert E. Chvátal, Vašek 1946- Cook, William 1957- |
| author_role | aut aut aut aut |
| author_sort | Applegate, David L. |
| author_variant | d l a dl dla r e b re reb v c vc w c wc |
| building | Verbundindex |
| bvnumber | BV042522946 |
| classification_tum | MAT 908 |
| collection | ZDB-23-DGG |
| ctrlnum | (OCoLC)910032142 (DE-599)BVBBV042522946 |
| dewey-full | 511.6 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.6 |
| dewey-search | 511.6 |
| dewey-sort | 3511.6 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03542nmm a2200457zc 4500</leader><controlfield tag="001">BV042522946</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20210210 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">150423s2011 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781400841103</subfield><subfield code="9">978-1-4008-4110-3</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1515/9781400841103</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)910032142</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV042522946</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-29</subfield><subfield code="a">DE-91</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.6</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 908</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Applegate, David L.</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1089639260</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The Traveling Salesman problem</subfield><subfield code="b">a computational study</subfield><subfield code="c">David L. Applegate, Robert E. Bixby, Vašek Chvátal, und William J. Cook</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Princeton, N.J.</subfield><subfield code="b">Princeton University Press</subfield><subfield code="c">2011</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (608 S.)</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="490" ind1="0" ind2=" "><subfield code="a">Princeton series in applied mathematics</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Biographical note: David L. Applegate is a researcher at AT&T Labs. Robert E. Bixby is Research Professor of Management and Noah Harding Professor of Computational and Applied Mathematics at Rice University. Vasek Chvátal is Canada Research Chair in Combinatorial Optimization at Concordia University. William J. Cook is Chandler Family Chair in Industrial and Systems Engineering at the Georgia Institute of Technology</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Main description: This book presents the latest findings on one of the most intensely investigated subjects in computational mathematics--the traveling salesman problem. It sounds simple enough: given a set of cities and the cost of travel between each pair of them, the problem challenges you to find the cheapest route by which to visit all the cities and return home to where you began. Though seemingly modest, this exercise has inspired studies by mathematicians, chemists, and physicists. Teachers use it in the classroom. It has practical applications in genetics, telecommunications, and neuroscience. The authors of this book are the same pioneers who for nearly two decades have led the investigation into the traveling salesman problem. They have derived solutions to almost eighty-six thousand cities, yet a general solution to the problem has yet to be discovered. Here they describe the method and computer code they used to solve a broad range of large-scale problems, and along the way they demonstrate the interplay of applied mathematics with increasingly powerful computing platforms. They also give the fascinating history of the problem--how it developed, and why it continues to intrigue us</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=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Bixby, Robert E.</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)170305279</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Chvátal, Vašek</subfield><subfield code="d">1946-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)110721772</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Cook, William</subfield><subfield code="d">1957-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)172025265</subfield><subfield code="4">aut</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://www.degruyter.com/doi/book/10.1515/9781400841103</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://www.degruyter.com/search?f_0=isbnissn&q_0=9781400841103&searchTitles=true</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-23-DGG</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-027957285</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1515/9781400841103?locatt=mode:legacy</subfield><subfield code="l">TUM01</subfield><subfield code="p">ZDB-23-DGG</subfield><subfield code="q">TUM_Einzelkauf</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1515/9781400841103?locatt=mode:legacy</subfield><subfield code="l">UER01</subfield><subfield code="p">ZDB-23-DGG</subfield><subfield code="q">UER_PDA_DGG_Kauf</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV042522946 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T01:24:02Z |
| institution | BVB |
| isbn | 9781400841103 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-027957285 |
| oclc_num | 910032142 |
| open_access_boolean | |
| owner | DE-29 DE-91 DE-BY-TUM |
| owner_facet | DE-29 DE-91 DE-BY-TUM |
| physical | 1 Online-Ressource (608 S.) |
| psigel | ZDB-23-DGG ZDB-23-DGG TUM_Einzelkauf ZDB-23-DGG UER_PDA_DGG_Kauf |
| publishDate | 2011 |
| publishDateSearch | 2011 |
| publishDateSort | 2011 |
| publisher | Princeton University Press |
| record_format | marc |
| series2 | Princeton series in applied mathematics |
| spelling | Applegate, David L. Verfasser (DE-588)1089639260 aut The Traveling Salesman problem a computational study David L. Applegate, Robert E. Bixby, Vašek Chvátal, und William J. Cook Princeton, N.J. Princeton University Press 2011 1 Online-Ressource (608 S.) txt rdacontent c rdamedia cr rdacarrier Princeton series in applied mathematics Biographical note: David L. Applegate is a researcher at AT&T Labs. Robert E. Bixby is Research Professor of Management and Noah Harding Professor of Computational and Applied Mathematics at Rice University. Vasek Chvátal is Canada Research Chair in Combinatorial Optimization at Concordia University. William J. Cook is Chandler Family Chair in Industrial and Systems Engineering at the Georgia Institute of Technology Main description: This book presents the latest findings on one of the most intensely investigated subjects in computational mathematics--the traveling salesman problem. It sounds simple enough: given a set of cities and the cost of travel between each pair of them, the problem challenges you to find the cheapest route by which to visit all the cities and return home to where you began. Though seemingly modest, this exercise has inspired studies by mathematicians, chemists, and physicists. Teachers use it in the classroom. It has practical applications in genetics, telecommunications, and neuroscience. The authors of this book are the same pioneers who for nearly two decades have led the investigation into the traveling salesman problem. They have derived solutions to almost eighty-six thousand cities, yet a general solution to the problem has yet to be discovered. Here they describe the method and computer code they used to solve a broad range of large-scale problems, and along the way they demonstrate the interplay of applied mathematics with increasingly powerful computing platforms. They also give the fascinating history of the problem--how it developed, and why it continues to intrigue us Travelling-salesman-Problem (DE-588)4185966-2 gnd rswk-swf Travelling-salesman-Problem (DE-588)4185966-2 s DE-604 Bixby, Robert E. Verfasser (DE-588)170305279 aut Chvátal, Vašek 1946- Verfasser (DE-588)110721772 aut Cook, William 1957- Verfasser (DE-588)172025265 aut http://www.degruyter.com/doi/book/10.1515/9781400841103 Verlag Volltext http://www.degruyter.com/search?f_0=isbnissn&q_0=9781400841103&searchTitles=true Verlag Volltext |
| spellingShingle | Applegate, David L. Bixby, Robert E. Chvátal, Vašek 1946- Cook, William 1957- The Traveling Salesman problem a computational study Travelling-salesman-Problem (DE-588)4185966-2 gnd |
| subject_GND | (DE-588)4185966-2 |
| title | The Traveling Salesman problem a computational study |
| title_auth | The Traveling Salesman problem a computational study |
| title_exact_search | The Traveling Salesman problem a computational study |
| title_full | The Traveling Salesman problem a computational study David L. Applegate, Robert E. Bixby, Vašek Chvátal, und William J. Cook |
| title_fullStr | The Traveling Salesman problem a computational study David L. Applegate, Robert E. Bixby, Vašek Chvátal, und William J. Cook |
| title_full_unstemmed | The Traveling Salesman problem a computational study David L. Applegate, Robert E. Bixby, Vašek Chvátal, und William J. Cook |
| title_short | The Traveling Salesman problem |
| title_sort | the traveling salesman problem a computational study |
| title_sub | a computational study |
| topic | Travelling-salesman-Problem (DE-588)4185966-2 gnd |
| topic_facet | Travelling-salesman-Problem |
| url | http://www.degruyter.com/doi/book/10.1515/9781400841103 http://www.degruyter.com/search?f_0=isbnissn&q_0=9781400841103&searchTitles=true |
| work_keys_str_mv | AT applegatedavidl thetravelingsalesmanproblemacomputationalstudy AT bixbyroberte thetravelingsalesmanproblemacomputationalstudy AT chvatalvasek thetravelingsalesmanproblemacomputationalstudy AT cookwilliam thetravelingsalesmanproblemacomputationalstudy |