Multiobjective traveling salesman problems and redundancy of complete sets:
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Abschlussarbeit Buch |
Sprache: | English |
Veröffentlicht: |
2014 [erschienen] 2015
|
Schlagworte: | |
Online-Zugang: | Volltext |
Beschreibung: | X, 172 S. |
Internformat
MARC
LEADER | 00000nam a2200000 c 4500 | ||
---|---|---|---|
001 | BV042396654 | ||
003 | DE-604 | ||
005 | 20150508 | ||
007 | t | ||
008 | 150309s2015 m||| 00||| eng d | ||
035 | |a (OCoLC)904709997 | ||
035 | |a (DE-599)BVBBV042396654 | ||
040 | |a DE-604 |b ger |e rakwb | ||
041 | 0 | |a eng | |
049 | |a DE-384 |a DE-473 |a DE-703 |a DE-1051 |a DE-824 |a DE-29 |a DE-12 |a DE-91 |a DE-19 |a DE-1049 |a DE-92 |a DE-739 |a DE-898 |a DE-355 |a DE-706 |a DE-20 |a DE-1102 | ||
084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
100 | 1 | |a Witek, Maximilian |e Verfasser |0 (DE-588)1068173998 |4 aut | |
245 | 1 | 0 | |a Multiobjective traveling salesman problems and redundancy of complete sets |c von Maximilian Witek |
246 | 1 | 3 | |a Mehrkriterielle Traveling Salesman Probleme und Redundanz vollständiger Mengen |
264 | 1 | |c 2014 [erschienen] 2015 | |
300 | |a X, 172 S. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
502 | |a Würzburg, Univ., Diss., 2015 | ||
650 | 0 | 7 | |a Approximationsalgorithmus |0 (DE-588)4500954-5 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Travelling-salesman-Problem |0 (DE-588)4185966-2 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Mehrkriterielle Optimierung |0 (DE-588)4610682-0 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Komplexitätsklasse |0 (DE-588)4164913-8 |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 Komplexitätstheorie |0 (DE-588)4120591-1 |D s |
689 | 0 | 3 | |a Komplexitätsklasse |0 (DE-588)4164913-8 |D s |
689 | 0 | 4 | |a Mehrkriterielle Optimierung |0 (DE-588)4610682-0 |D s |
689 | 0 | |5 DE-604 | |
776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |o urn:nbn:de:bvb:20-opus-110740 |
856 | 4 | 1 | |u https://nbn-resolving.org/urn:nbn:de:bvb:20-opus-110740 |x Resolving-System |z kostenfrei |3 Volltext |
912 | |a ebook | ||
999 | |a oai:aleph.bib-bvb.de:BVB01-027832425 |
Datensatz im Suchindex
_version_ | 1804153048998608896 |
---|---|
any_adam_object | |
author | Witek, Maximilian |
author_GND | (DE-588)1068173998 |
author_facet | Witek, Maximilian |
author_role | aut |
author_sort | Witek, Maximilian |
author_variant | m w mw |
building | Verbundindex |
bvnumber | BV042396654 |
classification_rvk | SK 890 ST 134 |
collection | ebook |
ctrlnum | (OCoLC)904709997 (DE-599)BVBBV042396654 |
discipline | Informatik Mathematik |
format | Thesis Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02054nam a2200469 c 4500</leader><controlfield tag="001">BV042396654</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20150508 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">150309s2015 m||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)904709997</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV042396654</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-384</subfield><subfield code="a">DE-473</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-1051</subfield><subfield code="a">DE-824</subfield><subfield code="a">DE-29</subfield><subfield code="a">DE-12</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-1049</subfield><subfield code="a">DE-92</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-898</subfield><subfield code="a">DE-355</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-1102</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 890</subfield><subfield code="0">(DE-625)143267:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 134</subfield><subfield code="0">(DE-625)143590:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Witek, Maximilian</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1068173998</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Multiobjective traveling salesman problems and redundancy of complete sets</subfield><subfield code="c">von Maximilian Witek</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">Mehrkriterielle Traveling Salesman Probleme und Redundanz vollständiger Mengen</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2014 [erschienen] 2015</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">X, 172 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="502" ind1=" " ind2=" "><subfield code="a">Würzburg, Univ., Diss., 2015</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="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">Mehrkriterielle Optimierung</subfield><subfield code="0">(DE-588)4610682-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Komplexitätsklasse</subfield><subfield code="0">(DE-588)4164913-8</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">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="3"><subfield code="a">Komplexitätsklasse</subfield><subfield code="0">(DE-588)4164913-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="4"><subfield code="a">Mehrkriterielle Optimierung</subfield><subfield code="0">(DE-588)4610682-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Online-Ausgabe</subfield><subfield code="o">urn:nbn:de:bvb:20-opus-110740</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://nbn-resolving.org/urn:nbn:de:bvb:20-opus-110740</subfield><subfield code="x">Resolving-System</subfield><subfield code="z">kostenfrei</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ebook</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-027832425</subfield></datafield></record></collection> |
genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
genre_facet | Hochschulschrift |
id | DE-604.BV042396654 |
illustrated | Not Illustrated |
indexdate | 2024-07-10T01:20:25Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-027832425 |
oclc_num | 904709997 |
open_access_boolean | 1 |
owner | DE-384 DE-473 DE-BY-UBG DE-703 DE-1051 DE-824 DE-29 DE-12 DE-91 DE-BY-TUM DE-19 DE-BY-UBM DE-1049 DE-92 DE-739 DE-898 DE-BY-UBR DE-355 DE-BY-UBR DE-706 DE-20 DE-1102 |
owner_facet | DE-384 DE-473 DE-BY-UBG DE-703 DE-1051 DE-824 DE-29 DE-12 DE-91 DE-BY-TUM DE-19 DE-BY-UBM DE-1049 DE-92 DE-739 DE-898 DE-BY-UBR DE-355 DE-BY-UBR DE-706 DE-20 DE-1102 |
physical | X, 172 S. |
psigel | ebook |
publishDate | 2014 |
publishDateSearch | 2015 |
publishDateSort | 2015 |
record_format | marc |
spelling | Witek, Maximilian Verfasser (DE-588)1068173998 aut Multiobjective traveling salesman problems and redundancy of complete sets von Maximilian Witek Mehrkriterielle Traveling Salesman Probleme und Redundanz vollständiger Mengen 2014 [erschienen] 2015 X, 172 S. txt rdacontent n rdamedia nc rdacarrier Würzburg, Univ., Diss., 2015 Approximationsalgorithmus (DE-588)4500954-5 gnd rswk-swf Travelling-salesman-Problem (DE-588)4185966-2 gnd rswk-swf Mehrkriterielle Optimierung (DE-588)4610682-0 gnd rswk-swf Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf Komplexitätsklasse (DE-588)4164913-8 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Travelling-salesman-Problem (DE-588)4185966-2 s Approximationsalgorithmus (DE-588)4500954-5 s Komplexitätstheorie (DE-588)4120591-1 s Komplexitätsklasse (DE-588)4164913-8 s Mehrkriterielle Optimierung (DE-588)4610682-0 s DE-604 Erscheint auch als Online-Ausgabe urn:nbn:de:bvb:20-opus-110740 https://nbn-resolving.org/urn:nbn:de:bvb:20-opus-110740 Resolving-System kostenfrei Volltext |
spellingShingle | Witek, Maximilian Multiobjective traveling salesman problems and redundancy of complete sets Approximationsalgorithmus (DE-588)4500954-5 gnd Travelling-salesman-Problem (DE-588)4185966-2 gnd Mehrkriterielle Optimierung (DE-588)4610682-0 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Komplexitätsklasse (DE-588)4164913-8 gnd |
subject_GND | (DE-588)4500954-5 (DE-588)4185966-2 (DE-588)4610682-0 (DE-588)4120591-1 (DE-588)4164913-8 (DE-588)4113937-9 |
title | Multiobjective traveling salesman problems and redundancy of complete sets |
title_alt | Mehrkriterielle Traveling Salesman Probleme und Redundanz vollständiger Mengen |
title_auth | Multiobjective traveling salesman problems and redundancy of complete sets |
title_exact_search | Multiobjective traveling salesman problems and redundancy of complete sets |
title_full | Multiobjective traveling salesman problems and redundancy of complete sets von Maximilian Witek |
title_fullStr | Multiobjective traveling salesman problems and redundancy of complete sets von Maximilian Witek |
title_full_unstemmed | Multiobjective traveling salesman problems and redundancy of complete sets von Maximilian Witek |
title_short | Multiobjective traveling salesman problems and redundancy of complete sets |
title_sort | multiobjective traveling salesman problems and redundancy of complete sets |
topic | Approximationsalgorithmus (DE-588)4500954-5 gnd Travelling-salesman-Problem (DE-588)4185966-2 gnd Mehrkriterielle Optimierung (DE-588)4610682-0 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Komplexitätsklasse (DE-588)4164913-8 gnd |
topic_facet | Approximationsalgorithmus Travelling-salesman-Problem Mehrkriterielle Optimierung Komplexitätstheorie Komplexitätsklasse Hochschulschrift |
url | https://nbn-resolving.org/urn:nbn:de:bvb:20-opus-110740 |
work_keys_str_mv | AT witekmaximilian multiobjectivetravelingsalesmanproblemsandredundancyofcompletesets AT witekmaximilian mehrkriterielletravelingsalesmanproblemeundredundanzvollstandigermengen |