The traveling salesman problem: a computational story
Gespeichert in:
| Format: | Buch |
|---|---|
| Sprache: | English |
| Veröffentlicht: |
Princeton, NJ[u.a.]
Princeton Univ. Press
2007
|
| Schriftenreihe: | Princeton series in applied mathematics
|
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis Klappentext |
| Beschreibung: | IX,593 S. Ill. |
| ISBN: | 0691129932 9780691129938 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV022541243 | ||
| 003 | DE-604 | ||
| 005 | 20171204 | ||
| 007 | t | ||
| 008 | 070802s2007 a||| |||| 00||| eng d | ||
| 020 | |a 0691129932 |9 0-6911-2993-2 | ||
| 020 | |a 9780691129938 |9 978-0-6911-2993-8 | ||
| 035 | |a (OCoLC)634876456 | ||
| 035 | |a (DE-599)BVBBV022541243 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-739 |a DE-523 |a DE-706 | ||
| 084 | |a QH 462 |0 (DE-625)141598: |2 rvk | ||
| 245 | 1 | 0 | |a The traveling salesman problem |b a computational story |c David L. Applegate ; Robert E. Bixby ; Vašek Chvatal and William J. Cook |
| 264 | 1 | |a Princeton, NJ[u.a.] |b Princeton Univ. Press |c 2007 | |
| 300 | |a IX,593 S. |b Ill. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a Princeton series in applied mathematics | |
| 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 Applegate, David L. |e Sonstige |0 (DE-588)1089639260 |4 oth | |
| 856 | 4 | 2 | |m Digitalisierung UB Passau |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=015747676&sequence=000003&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 856 | 4 | 2 | |m Digitalisierung UB Passau |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=015747676&sequence=000004&line_number=0002&func_code=DB_RECORDS&service_type=MEDIA |3 Klappentext |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-015747676 | ||
Datensatz im Suchindex
| _version_ | 1804136654871461888 |
|---|---|
| adam_text | Contents
Preface
Chapter
1.1
1.2
1.3
1.4
1.5
1.6
1.7
1.8
Chapter
2.1
2.2
2.3
2.4
2.5
2.6
2.7
Chapter
3.1
3.2
3.3
Chapter
4.1
4.2
4.3
4.4
4.5
4.6
4.7
Chapter
5.1
5.2
5.3 Outline
5.4
5.5
5.6
5.7
5.8
5.9
5.10
Chapter
6.1
6.2
6.3
6.4
6.5
Chapter
7.1
7.2
7.3
7.4
Chapter
8.1
8.2
Chapter
9.1
9.2
9.3
Chapter
10.1
10.2
10.3
10.4
Chapter
11.1
11.2
11.3
11.4
11.5
11.6
11.7
11.8
11.9
11.10
Chapters. Managing the Linear Programming Problems
12.1
12.2
12.3
12.4
Chapter
13.1
13.2
13.3
13.4
13.5
Chapter
14.1
14.2
14.3
14.4
Chapter
15.1
15.2
15.3
15.4
15.5
15.6
Chapter
16.1
16.2
16.3
16.4
16.5
Chapter^. The Road Goes On
17.1
17.2
17.3
Bibliography
Index
This book presents the latest findings on one
of the most intensely investigated subjects
in computational mathematics
salesman problem. It sounds simple enough:
given a set of cities and the cost of travel be¬
tween each pair of them, the problem chal¬
lenges you to find the cheapest route by which
to visit all the cities and return home to where
you began. Though seemingly modest, this ex¬
ercise has inspired studies by mathematicians,
chemists, and physicists. Teachers use it in the
classroom. It has practical applications in ge¬
netics, telecommunications, and
The authors of this book are the same pio¬
neers who for nearly two decades have led
the investigation into the traveling salesman
problem. They have derived solutions to al¬
most eighty-six thousand cities, yet a general
solution to the problem has yet to be discov¬
ered. Here they describe the method and com¬
puter code they used to solve a broad range of
large-scale problems, and along the way they
demonstrate the interplay of applied math¬
ematics with increasingly powerful computing
platforms, using the problem as a model. They
also give the fascinating history of the prob¬
lem
to intrigue us.
The Traveling Salesman Problem is the de¬
finitive book on the subject. It is the essen¬
tial resource for those in pursuit of a general
solution in this active and exhilarating area of
mathematical inquiry.
|
| adam_txt |
Contents
Preface
Chapter
1.1
1.2
1.3
1.4
1.5
1.6
1.7
1.8
Chapter
2.1
2.2
2.3
2.4
2.5
2.6
2.7
Chapter
3.1
3.2
3.3
Chapter
4.1
4.2
4.3
4.4
4.5
4.6
4.7
Chapter
5.1
5.2
5.3 Outline
5.4
5.5
5.6
5.7
5.8
5.9
5.10
Chapter
6.1
6.2
6.3
6.4
6.5
Chapter
7.1
7.2
7.3
7.4
Chapter
8.1
8.2
Chapter
9.1
9.2
9.3
Chapter
10.1
10.2
10.3
10.4
Chapter
11.1
11.2
11.3
11.4
11.5
11.6
11.7
11.8
11.9
11.10
Chapters. Managing the Linear Programming Problems
12.1
12.2
12.3
12.4
Chapter
13.1
13.2
13.3
13.4
13.5
Chapter
14.1
14.2
14.3
14.4
Chapter
15.1
15.2
15.3
15.4
15.5
15.6
Chapter
16.1
16.2
16.3
16.4
16.5
Chapter^. The Road Goes On
17.1
17.2
17.3
Bibliography
Index
This book presents the latest findings on one
of the most intensely investigated subjects
in computational mathematics
salesman problem. It sounds simple enough:
given a set of cities and the cost of travel be¬
tween each pair of them, the problem chal¬
lenges you to find the cheapest route by which
to visit all the cities and return home to where
you began. Though seemingly modest, this ex¬
ercise has inspired studies by mathematicians,
chemists, and physicists. Teachers use it in the
classroom. It has practical applications in ge¬
netics, telecommunications, and
The authors of this book are the same pio¬
neers who for nearly two decades have led
the investigation into the traveling salesman
problem. They have derived solutions to al¬
most eighty-six thousand cities, yet a general
solution to the problem has yet to be discov¬
ered. Here they describe the method and com¬
puter code they used to solve a broad range of
large-scale problems, and along the way they
demonstrate the interplay of applied math¬
ematics with increasingly powerful computing
platforms, using the problem as a model. They
also give the fascinating history of the prob¬
lem
to intrigue us.
The Traveling Salesman Problem is the de¬
finitive book on the subject. It is the essen¬
tial resource for those in pursuit of a general
solution in this active and exhilarating area of
mathematical inquiry. |
| any_adam_object | 1 |
| any_adam_object_boolean | 1 |
| author_GND | (DE-588)1089639260 |
| building | Verbundindex |
| bvnumber | BV022541243 |
| classification_rvk | QH 462 |
| ctrlnum | (OCoLC)634876456 (DE-599)BVBBV022541243 |
| discipline | Wirtschaftswissenschaften |
| discipline_str_mv | Wirtschaftswissenschaften |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01648nam a2200349 c 4500</leader><controlfield tag="001">BV022541243</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20171204 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">070802s2007 a||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0691129932</subfield><subfield code="9">0-6911-2993-2</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780691129938</subfield><subfield code="9">978-0-6911-2993-8</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)634876456</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV022541243</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-739</subfield><subfield code="a">DE-523</subfield><subfield code="a">DE-706</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">QH 462</subfield><subfield code="0">(DE-625)141598:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The traveling salesman problem</subfield><subfield code="b">a computational story</subfield><subfield code="c">David L. Applegate ; Robert E. Bixby ; Vašek Chvatal and William J. Cook</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Princeton, NJ[u.a.]</subfield><subfield code="b">Princeton Univ. Press</subfield><subfield code="c">2007</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">IX,593 S.</subfield><subfield code="b">Ill.</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">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</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="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">Applegate, David L.</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)1089639260</subfield><subfield code="4">oth</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UB Passau</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=015747676&sequence=000003&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UB Passau</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=015747676&sequence=000004&line_number=0002&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Klappentext</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-015747676</subfield></datafield></record></collection> |
| id | DE-604.BV022541243 |
| illustrated | Illustrated |
| index_date | 2024-07-02T18:10:22Z |
| indexdate | 2024-07-09T20:59:51Z |
| institution | BVB |
| isbn | 0691129932 9780691129938 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015747676 |
| oclc_num | 634876456 |
| open_access_boolean | |
| owner | DE-739 DE-523 DE-706 |
| owner_facet | DE-739 DE-523 DE-706 |
| physical | IX,593 S. Ill. |
| publishDate | 2007 |
| publishDateSearch | 2007 |
| publishDateSort | 2007 |
| publisher | Princeton Univ. Press |
| record_format | marc |
| series2 | Princeton series in applied mathematics |
| spelling | The traveling salesman problem a computational story David L. Applegate ; Robert E. Bixby ; Vašek Chvatal and William J. Cook Princeton, NJ[u.a.] Princeton Univ. Press 2007 IX,593 S. Ill. txt rdacontent n rdamedia nc rdacarrier Princeton series in applied mathematics Travelling-salesman-Problem (DE-588)4185966-2 gnd rswk-swf Travelling-salesman-Problem (DE-588)4185966-2 s DE-604 Applegate, David L. Sonstige (DE-588)1089639260 oth Digitalisierung UB Passau application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=015747676&sequence=000003&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis Digitalisierung UB Passau application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=015747676&sequence=000004&line_number=0002&func_code=DB_RECORDS&service_type=MEDIA Klappentext |
| spellingShingle | The traveling salesman problem a computational story Travelling-salesman-Problem (DE-588)4185966-2 gnd |
| subject_GND | (DE-588)4185966-2 |
| title | The traveling salesman problem a computational story |
| title_auth | The traveling salesman problem a computational story |
| title_exact_search | The traveling salesman problem a computational story |
| title_exact_search_txtP | The traveling salesman problem a computational story |
| title_full | The traveling salesman problem a computational story David L. Applegate ; Robert E. Bixby ; Vašek Chvatal and William J. Cook |
| title_fullStr | The traveling salesman problem a computational story David L. Applegate ; Robert E. Bixby ; Vašek Chvatal and William J. Cook |
| title_full_unstemmed | The traveling salesman problem a computational story David L. Applegate ; Robert E. Bixby ; Vašek Chvatal and William J. Cook |
| title_short | The traveling salesman problem |
| title_sort | the traveling salesman problem a computational story |
| title_sub | a computational story |
| topic | Travelling-salesman-Problem (DE-588)4185966-2 gnd |
| topic_facet | Travelling-salesman-Problem |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=015747676&sequence=000003&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=015747676&sequence=000004&line_number=0002&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT applegatedavidl thetravelingsalesmanproblemacomputationalstory |