Traveling salesman problem with path dependent costs: generalization of one-dimensional search with traveling costs
Gespeichert in:
| Beteiligte Personen: | , |
|---|---|
| Format: | Buch |
| Sprache: | Englisch |
| Veröffentlicht: |
Neubiberg
Univ. der Bundeswehr München, Fak. für Informatik
1992
|
| Schriftenreihe: | Deutschland <Bundesrepublik> / Bundeswehr / Universität <München> / Fakultät für Informatik: Bericht / S
1992,1 |
| Schlagwörter: | |
| Umfang: | 14 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009521838 | ||
| 003 | DE-604 | ||
| 005 | 20230313 | ||
| 007 | t| | ||
| 008 | 940408s1992 xx |||| 00||| eng d | ||
| 016 | 7 | |a 942958101 |2 DE-101 | |
| 035 | |a (OCoLC)165100914 | ||
| 035 | |a (DE-599)BVBBV009521838 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-12 | ||
| 100 | 1 | |a Cao, Buyang |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Traveling salesman problem with path dependent costs |b generalization of one-dimensional search with traveling costs |c Buyang Cao ; Klaus Rinderle |
| 264 | 1 | |a Neubiberg |b Univ. der Bundeswehr München, Fak. für Informatik |c 1992 | |
| 300 | |a 14 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Deutschland <Bundesrepublik> / Bundeswehr / Universität <München> / Fakultät für Informatik: Bericht / S |v 1992,1 | |
| 650 | 0 | 7 | |a Travelling-salesman-Problem |0 (DE-588)4185966-2 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Suchverfahren |0 (DE-588)4132315-4 |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 | 1 | |a Suchverfahren |0 (DE-588)4132315-4 |D s |
| 689 | 0 | 2 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Rinderle, Klaus |e Verfasser |4 aut | |
| 810 | 2 | |a Bundeswehr / Universität <München> / Fakultät für Informatik: Bericht / S |t Deutschland <Bundesrepublik> |v 1992,1 |w (DE-604)BV008939183 |9 1992,1 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-006287120 | |
Datensatz im Suchindex
| _version_ | 1818951637933228032 |
|---|---|
| any_adam_object | |
| author | Cao, Buyang Rinderle, Klaus |
| author_facet | Cao, Buyang Rinderle, Klaus |
| author_role | aut aut |
| author_sort | Cao, Buyang |
| author_variant | b c bc k r kr |
| building | Verbundindex |
| bvnumber | BV009521838 |
| ctrlnum | (OCoLC)165100914 (DE-599)BVBBV009521838 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01542nam a2200373 cb4500</leader><controlfield tag="001">BV009521838</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20230313 </controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">940408s1992 xx |||| 00||| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">942958101</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)165100914</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009521838</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-12</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Cao, Buyang</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Traveling salesman problem with path dependent costs</subfield><subfield code="b">generalization of one-dimensional search with traveling costs</subfield><subfield code="c">Buyang Cao ; Klaus Rinderle</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Neubiberg</subfield><subfield code="b">Univ. der Bundeswehr München, Fak. für Informatik</subfield><subfield code="c">1992</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">14 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">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="1" ind2=" "><subfield code="a">Deutschland <Bundesrepublik> / Bundeswehr / Universität <München> / Fakultät für Informatik: Bericht / S</subfield><subfield code="v">1992,1</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">Suchverfahren</subfield><subfield code="0">(DE-588)4132315-4</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="1"><subfield code="a">Suchverfahren</subfield><subfield code="0">(DE-588)4132315-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</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">Rinderle, Klaus</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Bundeswehr / Universität <München> / Fakultät für Informatik: Bericht / S</subfield><subfield code="t">Deutschland <Bundesrepublik></subfield><subfield code="v">1992,1</subfield><subfield code="w">(DE-604)BV008939183</subfield><subfield code="9">1992,1</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006287120</subfield></datafield></record></collection> |
| id | DE-604.BV009521838 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-20T09:37:39Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006287120 |
| oclc_num | 165100914 |
| open_access_boolean | |
| owner | DE-12 |
| owner_facet | DE-12 |
| physical | 14 S. |
| publishDate | 1992 |
| publishDateSearch | 1992 |
| publishDateSort | 1992 |
| publisher | Univ. der Bundeswehr München, Fak. für Informatik |
| record_format | marc |
| series2 | Deutschland <Bundesrepublik> / Bundeswehr / Universität <München> / Fakultät für Informatik: Bericht / S |
| spelling | Cao, Buyang Verfasser aut Traveling salesman problem with path dependent costs generalization of one-dimensional search with traveling costs Buyang Cao ; Klaus Rinderle Neubiberg Univ. der Bundeswehr München, Fak. für Informatik 1992 14 S. txt rdacontent n rdamedia nc rdacarrier Deutschland <Bundesrepublik> / Bundeswehr / Universität <München> / Fakultät für Informatik: Bericht / S 1992,1 Travelling-salesman-Problem (DE-588)4185966-2 gnd rswk-swf Suchverfahren (DE-588)4132315-4 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Travelling-salesman-Problem (DE-588)4185966-2 s Suchverfahren (DE-588)4132315-4 s Algorithmus (DE-588)4001183-5 s DE-604 Rinderle, Klaus Verfasser aut Bundeswehr / Universität <München> / Fakultät für Informatik: Bericht / S Deutschland <Bundesrepublik> 1992,1 (DE-604)BV008939183 1992,1 |
| spellingShingle | Cao, Buyang Rinderle, Klaus Traveling salesman problem with path dependent costs generalization of one-dimensional search with traveling costs Travelling-salesman-Problem (DE-588)4185966-2 gnd Suchverfahren (DE-588)4132315-4 gnd Algorithmus (DE-588)4001183-5 gnd |
| subject_GND | (DE-588)4185966-2 (DE-588)4132315-4 (DE-588)4001183-5 |
| title | Traveling salesman problem with path dependent costs generalization of one-dimensional search with traveling costs |
| title_auth | Traveling salesman problem with path dependent costs generalization of one-dimensional search with traveling costs |
| title_exact_search | Traveling salesman problem with path dependent costs generalization of one-dimensional search with traveling costs |
| title_full | Traveling salesman problem with path dependent costs generalization of one-dimensional search with traveling costs Buyang Cao ; Klaus Rinderle |
| title_fullStr | Traveling salesman problem with path dependent costs generalization of one-dimensional search with traveling costs Buyang Cao ; Klaus Rinderle |
| title_full_unstemmed | Traveling salesman problem with path dependent costs generalization of one-dimensional search with traveling costs Buyang Cao ; Klaus Rinderle |
| title_short | Traveling salesman problem with path dependent costs |
| title_sort | traveling salesman problem with path dependent costs generalization of one dimensional search with traveling costs |
| title_sub | generalization of one-dimensional search with traveling costs |
| topic | Travelling-salesman-Problem (DE-588)4185966-2 gnd Suchverfahren (DE-588)4132315-4 gnd Algorithmus (DE-588)4001183-5 gnd |
| topic_facet | Travelling-salesman-Problem Suchverfahren Algorithmus |
| volume_link | (DE-604)BV008939183 |
| work_keys_str_mv | AT caobuyang travelingsalesmanproblemwithpathdependentcostsgeneralizationofonedimensionalsearchwithtravelingcosts AT rinderleklaus travelingsalesmanproblemwithpathdependentcostsgeneralizationofonedimensionalsearchwithtravelingcosts |