New multiobjective shortest path algorithms:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Abschlussarbeit Buch |
| Sprache: | English |
| Veröffentlicht: |
Berlin
2023
|
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Beschreibung: | 216 Seiten Diagramme |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV049778831 | ||
| 003 | DE-604 | ||
| 007 | t | ||
| 008 | 240712s2023 |||| m||| 00||| eng d | ||
| 035 | |a (OCoLC)1446258930 | ||
| 035 | |a (DE-599)BVBBV049778831 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-188 | ||
| 082 | 0 | |a 519 |2 23 | |
| 082 | 0 | |a 005 |2 23 | |
| 100 | 1 | |a Maristany de las Casas, Pedro |e Verfasser |0 (DE-588)1246888572 |4 aut | |
| 245 | 1 | 0 | |a New multiobjective shortest path algorithms |c vorgelegt von Pedro Maristany de las Casas |
| 264 | 1 | |a Berlin |c 2023 | |
| 300 | |a 216 Seiten |b Diagramme | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 502 | |b Dissertation |c Freie Universität Berlin |d 2024 | ||
| 650 | 4 | |a Multiobjective Combinatorial Optimization | |
| 650 | 4 | |a Dynamic Programming | |
| 650 | 4 | |a Shortest Paths | |
| 650 | 4 | |a Dijkstra Algortihm | |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |a Maristany de las Casas, Pedro |t New multiobjective shortest path algorithms |o 10.17169/refubium-43569 |w (DE-604)BV049778815 |
| 856 | 4 | 1 | |u https://refubium.fu-berlin.de/handle/fub188/43859 |x Resolving-System |z kostenfrei |3 Volltext |
| 912 | |a ebook | ||
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-035119847 | |
Datensatz im Suchindex
| _version_ | 1806142701520814081 |
|---|---|
| adam_text | |
| any_adam_object | |
| author | Maristany de las Casas, Pedro |
| author_GND | (DE-588)1246888572 |
| author_facet | Maristany de las Casas, Pedro |
| author_role | aut |
| author_sort | Maristany de las Casas, Pedro |
| author_variant | d l c p m dlcp dlcpm |
| building | Verbundindex |
| bvnumber | BV049778831 |
| collection | ebook |
| ctrlnum | (OCoLC)1446258930 (DE-599)BVBBV049778831 |
| dewey-full | 519 005 |
| dewey-hundreds | 500 - Natural sciences and mathematics 000 - Computer science, information, general works |
| dewey-ones | 519 - Probabilities and applied mathematics 005 - Computer programming, programs, data, security |
| dewey-raw | 519 005 |
| dewey-search | 519 005 |
| dewey-sort | 3519 |
| dewey-tens | 510 - Mathematics 000 - Computer science, information, general works |
| discipline | Informatik Mathematik |
| format | Thesis Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 c 4500</leader><controlfield tag="001">BV049778831</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">240712s2023 |||| m||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1446258930</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV049778831</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-188</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">519</subfield><subfield code="2">23</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005</subfield><subfield code="2">23</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Maristany de las Casas, Pedro</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1246888572</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">New multiobjective shortest path algorithms</subfield><subfield code="c">vorgelegt von Pedro Maristany de las Casas</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin</subfield><subfield code="c">2023</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">216 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">Freie Universität Berlin</subfield><subfield code="d">2024</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Multiobjective Combinatorial Optimization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Dynamic Programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Shortest Paths</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Dijkstra Algortihm</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="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Online-Ausgabe</subfield><subfield code="a">Maristany de las Casas, Pedro</subfield><subfield code="t">New multiobjective shortest path algorithms</subfield><subfield code="o">10.17169/refubium-43569</subfield><subfield code="w">(DE-604)BV049778815</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://refubium.fu-berlin.de/handle/fub188/43859</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="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-035119847</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV049778831 |
| illustrated | Not Illustrated |
| indexdate | 2024-08-01T00:25:06Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-035119847 |
| oclc_num | 1446258930 |
| open_access_boolean | 1 |
| owner | DE-188 |
| owner_facet | DE-188 |
| physical | 216 Seiten Diagramme |
| psigel | ebook |
| publishDate | 2023 |
| publishDateSearch | 2023 |
| publishDateSort | 2023 |
| record_format | marc |
| spelling | Maristany de las Casas, Pedro Verfasser (DE-588)1246888572 aut New multiobjective shortest path algorithms vorgelegt von Pedro Maristany de las Casas Berlin 2023 216 Seiten Diagramme txt rdacontent n rdamedia nc rdacarrier Dissertation Freie Universität Berlin 2024 Multiobjective Combinatorial Optimization Dynamic Programming Shortest Paths Dijkstra Algortihm (DE-588)4113937-9 Hochschulschrift gnd-content Erscheint auch als Online-Ausgabe Maristany de las Casas, Pedro New multiobjective shortest path algorithms 10.17169/refubium-43569 (DE-604)BV049778815 https://refubium.fu-berlin.de/handle/fub188/43859 Resolving-System kostenfrei Volltext |
| spellingShingle | Maristany de las Casas, Pedro New multiobjective shortest path algorithms Multiobjective Combinatorial Optimization Dynamic Programming Shortest Paths Dijkstra Algortihm |
| subject_GND | (DE-588)4113937-9 |
| title | New multiobjective shortest path algorithms |
| title_auth | New multiobjective shortest path algorithms |
| title_exact_search | New multiobjective shortest path algorithms |
| title_full | New multiobjective shortest path algorithms vorgelegt von Pedro Maristany de las Casas |
| title_fullStr | New multiobjective shortest path algorithms vorgelegt von Pedro Maristany de las Casas |
| title_full_unstemmed | New multiobjective shortest path algorithms vorgelegt von Pedro Maristany de las Casas |
| title_short | New multiobjective shortest path algorithms |
| title_sort | new multiobjective shortest path algorithms |
| topic | Multiobjective Combinatorial Optimization Dynamic Programming Shortest Paths Dijkstra Algortihm |
| topic_facet | Multiobjective Combinatorial Optimization Dynamic Programming Shortest Paths Dijkstra Algortihm Hochschulschrift |
| url | https://refubium.fu-berlin.de/handle/fub188/43859 |
| work_keys_str_mv | AT maristanydelascasaspedro newmultiobjectiveshortestpathalgorithms |