The traveling salesman: computational solutions for TSP applications
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Berlin [u.a.]
Springer
1994
|
| Schriftenreihe: | Lecture notes in computer science
840 |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Beschreibung: | 1 Online-Ressource (VIII, 223 S.) graph. Darst. |
| ISBN: | 3540583343 0387583343 |
| DOI: | 10.1007/3-540-48661-5 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV035717428 | ||
| 003 | DE-604 | ||
| 005 | 20180607 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 090909s1994 gw d||| o|||| 00||| eng d | ||
| 020 | |a 3540583343 |9 3-540-58334-3 | ||
| 020 | |a 0387583343 |9 0-387-58334-3 | ||
| 024 | 7 | |a 10.1007/3-540-48661-5 |2 doi | |
| 035 | |a (OCoLC)699834707 | ||
| 035 | |a (DE-599)BVBBV035717428 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c DE | ||
| 049 | |a DE-12 |a DE-634 |a DE-210 |a DE-Aug4 |a DE-M347 |a DE-860 |a DE-70 |a DE-91 |a DE-384 |a DE-473 |a DE-19 |a DE-355 |a DE-703 |a DE-29 |a DE-739 |a DE-859 |a DE-1046 |a DE-706 |a DE-526 |a DE-521 |a DE-573 |a DE-523 | ||
| 050 | 0 | |a T57.78.R47 1994 | |
| 082 | 0 | |a 511/.5 20 | |
| 084 | |a QH 499 |0 (DE-625)141605: |2 rvk | ||
| 084 | |a MAT 913f |2 stub | ||
| 084 | |a DAT 537f |2 stub | ||
| 100 | 1 | |a Reinelt, Gerhard |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a The traveling salesman |b computational solutions for TSP applications |c Gerhard Reinelt |
| 264 | 1 | |a Berlin [u.a.] |b Springer |c 1994 | |
| 300 | |a 1 Online-Ressource (VIII, 223 S.) |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 1 | |a Lecture notes in computer science |v 840 | |
| 650 | 4 | |a Traveling-salesman problem | |
| 650 | 4 | |a Heuristic programming | |
| 650 | 4 | |a Algorithms | |
| 650 | 0 | 7 | |a Travelling-salesman-Problem |0 (DE-588)4185966-2 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Kombinatorische Optimierung |0 (DE-588)4031826-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Travelling-salesman-Problem |0 (DE-588)4185966-2 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Kombinatorische Optimierung |0 (DE-588)4031826-6 |D s |
| 689 | 1 | 1 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 1 | |5 DE-604 | |
| 830 | 0 | |a Lecture notes in computer science |v 840 |w (DE-604)BV014880109 |9 840 | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/3-540-48661-5 |x Verlag |3 Volltext |
| 912 | |a ZDB-1-SLN | ||
| 912 | |a ZDB-2-LNC | ||
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-017994266 | |
Datensatz im Suchindex
| _version_ | 1820875163781038080 |
|---|---|
| adam_text | |
| any_adam_object | |
| author | Reinelt, Gerhard |
| author_facet | Reinelt, Gerhard |
| author_role | aut |
| author_sort | Reinelt, Gerhard |
| author_variant | g r gr |
| building | Verbundindex |
| bvnumber | BV035717428 |
| callnumber-first | T - Technology |
| callnumber-label | T57 |
| callnumber-raw | T57.78.R47 1994 |
| callnumber-search | T57.78.R47 1994 |
| callnumber-sort | T 257.78 R47 41994 |
| callnumber-subject | T - General Technology |
| classification_rvk | QH 499 |
| classification_tum | MAT 913f DAT 537f |
| collection | ZDB-1-SLN ZDB-2-LNC |
| ctrlnum | (OCoLC)699834707 (DE-599)BVBBV035717428 |
| dewey-full | 511/.520 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511/.5 20 |
| dewey-search | 511/.5 20 |
| dewey-sort | 3511 15 220 |
| dewey-tens | 510 - Mathematics |
| discipline | Informatik Mathematik Wirtschaftswissenschaften |
| doi_str_mv | 10.1007/3-540-48661-5 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV035717428</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20180607</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">090909s1994 gw d||| o|||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3540583343</subfield><subfield code="9">3-540-58334-3</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0387583343</subfield><subfield code="9">0-387-58334-3</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/3-540-48661-5</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)699834707</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV035717428</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-210</subfield><subfield code="a">DE-Aug4</subfield><subfield code="a">DE-M347</subfield><subfield code="a">DE-860</subfield><subfield code="a">DE-70</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-473</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-355</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-29</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-859</subfield><subfield code="a">DE-1046</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-526</subfield><subfield code="a">DE-521</subfield><subfield code="a">DE-573</subfield><subfield code="a">DE-523</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">T57.78.R47 1994</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511/.5 20</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">QH 499</subfield><subfield code="0">(DE-625)141605:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 913f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 537f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Reinelt, Gerhard</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The traveling salesman</subfield><subfield code="b">computational solutions for TSP applications</subfield><subfield code="c">Gerhard Reinelt</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">1994</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (VIII, 223 S.)</subfield><subfield code="b">graph. Darst.</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="1" ind2=" "><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">840</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">Heuristic programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</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="650" ind1="0" ind2="7"><subfield code="a">Kombinatorische Optimierung</subfield><subfield code="0">(DE-588)4031826-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</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="689" ind1="1" ind2="0"><subfield code="a">Kombinatorische Optimierung</subfield><subfield code="0">(DE-588)4031826-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">840</subfield><subfield code="w">(DE-604)BV014880109</subfield><subfield code="9">840</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/3-540-48661-5</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-1-SLN</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-LNC</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-017994266</subfield></datafield></record></collection> |
| id | DE-604.BV035717428 |
| illustrated | Illustrated |
| indexdate | 2025-01-10T15:11:16Z |
| institution | BVB |
| isbn | 3540583343 0387583343 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-017994266 |
| oclc_num | 699834707 |
| open_access_boolean | |
| owner | DE-12 DE-634 DE-210 DE-Aug4 DE-M347 DE-860 DE-70 DE-91 DE-BY-TUM DE-384 DE-473 DE-BY-UBG DE-19 DE-BY-UBM DE-355 DE-BY-UBR DE-703 DE-29 DE-739 DE-859 DE-1046 DE-706 DE-526 DE-521 DE-573 DE-523 |
| owner_facet | DE-12 DE-634 DE-210 DE-Aug4 DE-M347 DE-860 DE-70 DE-91 DE-BY-TUM DE-384 DE-473 DE-BY-UBG DE-19 DE-BY-UBM DE-355 DE-BY-UBR DE-703 DE-29 DE-739 DE-859 DE-1046 DE-706 DE-526 DE-521 DE-573 DE-523 |
| physical | 1 Online-Ressource (VIII, 223 S.) graph. Darst. |
| psigel | ZDB-1-SLN ZDB-2-LNC |
| publishDate | 1994 |
| publishDateSearch | 1994 |
| publishDateSort | 1994 |
| publisher | Springer |
| record_format | marc |
| series | Lecture notes in computer science |
| series2 | Lecture notes in computer science |
| spelling | Reinelt, Gerhard Verfasser aut The traveling salesman computational solutions for TSP applications Gerhard Reinelt Berlin [u.a.] Springer 1994 1 Online-Ressource (VIII, 223 S.) graph. Darst. txt rdacontent c rdamedia cr rdacarrier Lecture notes in computer science 840 Traveling-salesman problem Heuristic programming Algorithms Travelling-salesman-Problem (DE-588)4185966-2 gnd rswk-swf Kombinatorische Optimierung (DE-588)4031826-6 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Travelling-salesman-Problem (DE-588)4185966-2 s DE-604 Kombinatorische Optimierung (DE-588)4031826-6 s Algorithmus (DE-588)4001183-5 s Lecture notes in computer science 840 (DE-604)BV014880109 840 https://doi.org/10.1007/3-540-48661-5 Verlag Volltext |
| spellingShingle | Reinelt, Gerhard The traveling salesman computational solutions for TSP applications Lecture notes in computer science Traveling-salesman problem Heuristic programming Algorithms Travelling-salesman-Problem (DE-588)4185966-2 gnd Kombinatorische Optimierung (DE-588)4031826-6 gnd Algorithmus (DE-588)4001183-5 gnd |
| subject_GND | (DE-588)4185966-2 (DE-588)4031826-6 (DE-588)4001183-5 |
| title | The traveling salesman computational solutions for TSP applications |
| title_auth | The traveling salesman computational solutions for TSP applications |
| title_exact_search | The traveling salesman computational solutions for TSP applications |
| title_full | The traveling salesman computational solutions for TSP applications Gerhard Reinelt |
| title_fullStr | The traveling salesman computational solutions for TSP applications Gerhard Reinelt |
| title_full_unstemmed | The traveling salesman computational solutions for TSP applications Gerhard Reinelt |
| title_short | The traveling salesman |
| title_sort | the traveling salesman computational solutions for tsp applications |
| title_sub | computational solutions for TSP applications |
| topic | Traveling-salesman problem Heuristic programming Algorithms Travelling-salesman-Problem (DE-588)4185966-2 gnd Kombinatorische Optimierung (DE-588)4031826-6 gnd Algorithmus (DE-588)4001183-5 gnd |
| topic_facet | Traveling-salesman problem Heuristic programming Algorithms Travelling-salesman-Problem Kombinatorische Optimierung Algorithmus |
| url | https://doi.org/10.1007/3-540-48661-5 |
| volume_link | (DE-604)BV014880109 |
| work_keys_str_mv | AT reineltgerhard thetravelingsalesmancomputationalsolutionsfortspapplications |