Exact and approximation algorithms for many-visits travelling salesperson problems:
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Abschlussarbeit Buch |
Sprache: | English |
Veröffentlicht: |
Hamburg
2021
|
Schlagworte: | |
Beschreibung: | iv, 111 Seiten Diagramme |
Internformat
MARC
LEADER | 00000nam a2200000 c 4500 | ||
---|---|---|---|
001 | BV048415906 | ||
003 | DE-604 | ||
005 | 20230117 | ||
007 | t | ||
008 | 220822s2021 |||| m||| 00||| eng d | ||
035 | |a (OCoLC)1352880039 | ||
035 | |a (DE-599)BVBBV048415906 | ||
040 | |a DE-604 |b ger |e rda | ||
041 | 0 | |a eng | |
049 | |a DE-384 | ||
084 | |a QH 462 |0 (DE-625)141598: |2 rvk | ||
100 | 1 | |a Vincze, Roland |e Verfasser |0 (DE-588)120325489X |4 aut | |
245 | 1 | 0 | |a Exact and approximation algorithms for many-visits travelling salesperson problems |c von Roland Vincze |
264 | 1 | |a Hamburg |c 2021 | |
300 | |a iv, 111 Seiten |b Diagramme | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
502 | |b Dissertation |c Technische Universität Hamburg |d 2021 | ||
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 Approximationsalgorithmus |0 (DE-588)4500954-5 |2 gnd |9 rswk-swf |
655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
689 | 0 | 0 | |a Travelling-salesman-Problem |0 (DE-588)4185966-2 |D s |
689 | 0 | 1 | |a Approximationsalgorithmus |0 (DE-588)4500954-5 |D s |
689 | 0 | 2 | |a Kombinatorische Optimierung |0 (DE-588)4031826-6 |D s |
689 | 0 | |5 DE-604 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-033794284 |
Datensatz im Suchindex
_version_ | 1804184328690728960 |
---|---|
adam_txt | |
any_adam_object | |
any_adam_object_boolean | |
author | Vincze, Roland |
author_GND | (DE-588)120325489X |
author_facet | Vincze, Roland |
author_role | aut |
author_sort | Vincze, Roland |
author_variant | r v rv |
building | Verbundindex |
bvnumber | BV048415906 |
classification_rvk | QH 462 |
ctrlnum | (OCoLC)1352880039 (DE-599)BVBBV048415906 |
discipline | Wirtschaftswissenschaften |
discipline_str_mv | Wirtschaftswissenschaften |
format | Thesis Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01344nam a2200361 c 4500</leader><controlfield tag="001">BV048415906</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20230117 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">220822s2021 |||| m||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1352880039</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV048415906</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-384</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="100" ind1="1" ind2=" "><subfield code="a">Vincze, Roland</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)120325489X</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Exact and approximation algorithms for many-visits travelling salesperson problems</subfield><subfield code="c">von Roland Vincze</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Hamburg</subfield><subfield code="c">2021</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">iv, 111 Seiten</subfield><subfield code="b">Diagramme</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="502" ind1=" " ind2=" "><subfield code="b">Dissertation</subfield><subfield code="c">Technische Universität Hamburg</subfield><subfield code="d">2021</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">Approximationsalgorithmus</subfield><subfield code="0">(DE-588)4500954-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</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">Approximationsalgorithmus</subfield><subfield code="0">(DE-588)4500954-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Kombinatorische Optimierung</subfield><subfield code="0">(DE-588)4031826-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-033794284</subfield></datafield></record></collection> |
genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
genre_facet | Hochschulschrift |
id | DE-604.BV048415906 |
illustrated | Not Illustrated |
index_date | 2024-07-03T20:26:32Z |
indexdate | 2024-07-10T09:37:36Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-033794284 |
oclc_num | 1352880039 |
open_access_boolean | |
owner | DE-384 |
owner_facet | DE-384 |
physical | iv, 111 Seiten Diagramme |
publishDate | 2021 |
publishDateSearch | 2021 |
publishDateSort | 2021 |
record_format | marc |
spelling | Vincze, Roland Verfasser (DE-588)120325489X aut Exact and approximation algorithms for many-visits travelling salesperson problems von Roland Vincze Hamburg 2021 iv, 111 Seiten Diagramme txt rdacontent n rdamedia nc rdacarrier Dissertation Technische Universität Hamburg 2021 Travelling-salesman-Problem (DE-588)4185966-2 gnd rswk-swf Kombinatorische Optimierung (DE-588)4031826-6 gnd rswk-swf Approximationsalgorithmus (DE-588)4500954-5 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Travelling-salesman-Problem (DE-588)4185966-2 s Approximationsalgorithmus (DE-588)4500954-5 s Kombinatorische Optimierung (DE-588)4031826-6 s DE-604 |
spellingShingle | Vincze, Roland Exact and approximation algorithms for many-visits travelling salesperson problems Travelling-salesman-Problem (DE-588)4185966-2 gnd Kombinatorische Optimierung (DE-588)4031826-6 gnd Approximationsalgorithmus (DE-588)4500954-5 gnd |
subject_GND | (DE-588)4185966-2 (DE-588)4031826-6 (DE-588)4500954-5 (DE-588)4113937-9 |
title | Exact and approximation algorithms for many-visits travelling salesperson problems |
title_auth | Exact and approximation algorithms for many-visits travelling salesperson problems |
title_exact_search | Exact and approximation algorithms for many-visits travelling salesperson problems |
title_exact_search_txtP | Exact and approximation algorithms for many-visits travelling salesperson problems |
title_full | Exact and approximation algorithms for many-visits travelling salesperson problems von Roland Vincze |
title_fullStr | Exact and approximation algorithms for many-visits travelling salesperson problems von Roland Vincze |
title_full_unstemmed | Exact and approximation algorithms for many-visits travelling salesperson problems von Roland Vincze |
title_short | Exact and approximation algorithms for many-visits travelling salesperson problems |
title_sort | exact and approximation algorithms for many visits travelling salesperson problems |
topic | Travelling-salesman-Problem (DE-588)4185966-2 gnd Kombinatorische Optimierung (DE-588)4031826-6 gnd Approximationsalgorithmus (DE-588)4500954-5 gnd |
topic_facet | Travelling-salesman-Problem Kombinatorische Optimierung Approximationsalgorithmus Hochschulschrift |
work_keys_str_mv | AT vinczeroland exactandapproximationalgorithmsformanyvisitstravellingsalespersonproblems |