Algorithms and Complexity for Scheduling and Packing Problems:
Gespeichert in:
| Beteilige Person: | |
|---|---|
| Format: | Hochschulschrift/Dissertation Buch |
| Sprache: | Englisch |
| Veröffentlicht: |
München
Verlag Dr. Hut
2018
|
| Ausgabe: | 1. Auflage |
| Schriftenreihe: | Mathematik
|
| Schlagwörter: | |
| Links: | http://deposit.dnb.de/cgi-bin/dokserv?id=f346662f0f65486d96b8d74880347284&prov=M&dok_var=1&dok_ext=htm http://www.dr.hut-verlag.de/978-3-8439-3434-3.html |
| Umfang: | xii, 171 Seiten Diagramme 21 cm x 14.8 cm, 371 g |
| ISBN: | 9783843934343 3843934347 |
Internformat
MARC
| LEADER | 00000nam a22000008c 4500 | ||
|---|---|---|---|
| 001 | BV044890725 | ||
| 003 | DE-604 | ||
| 005 | 20180419 | ||
| 007 | t| | ||
| 008 | 180404s2018 gw |||| m||| 00||| eng d | ||
| 015 | |a 18,N06 |2 dnb | ||
| 016 | 7 | |a 1151593583 |2 DE-101 | |
| 020 | |a 9783843934343 |c Hardcover kaschiert : EUR 72.00 (DE), EUR 74.10 (AT) |9 978-3-8439-3434-3 | ||
| 020 | |a 3843934347 |9 3-8439-3434-7 | ||
| 024 | 3 | |a 9783843934343 | |
| 035 | |a (OCoLC)1027720854 | ||
| 035 | |a (DE-599)DNB1151593583 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c XA-DE-BY | ||
| 049 | |a DE-12 |a DE-19 |a DE-29 | ||
| 084 | |a 510 |2 sdnb | ||
| 100 | 1 | |a Hopf, Michael |e Verfasser |0 (DE-588)1137876603 |4 aut | |
| 245 | 1 | 0 | |a Algorithms and Complexity for Scheduling and Packing Problems |c Michael Hopf |
| 250 | |a 1. Auflage | ||
| 264 | 1 | |a München |b Verlag Dr. Hut |c 2018 | |
| 300 | |a xii, 171 Seiten |b Diagramme |c 21 cm x 14.8 cm, 371 g | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a Mathematik | |
| 502 | |b Dissertation |c Technische Universität Kaiserslautern |d 2017 | ||
| 650 | 0 | 7 | |a Reihenfolgeproblem |0 (DE-588)4242167-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Packungsproblem |0 (DE-588)4173057-4 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Approximation |0 (DE-588)4002498-2 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |2 gnd |9 rswk-swf |
| 653 | |a Algorithms | ||
| 653 | |a Complexity | ||
| 653 | |a Approximation | ||
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Reihenfolgeproblem |0 (DE-588)4242167-6 |D s |
| 689 | 0 | 1 | |a Packungsproblem |0 (DE-588)4173057-4 |D s |
| 689 | 0 | 2 | |a Approximation |0 (DE-588)4002498-2 |D s |
| 689 | 0 | 3 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |D s |
| 689 | 0 | |5 DE-604 | |
| 710 | 2 | |a Verlag Dr. Hut (München) |0 (DE-588)10174118-2 |4 pbl | |
| 856 | 4 | 2 | |m X:MVB |q text/html |u http://deposit.dnb.de/cgi-bin/dokserv?id=f346662f0f65486d96b8d74880347284&prov=M&dok_var=1&dok_ext=htm |3 Inhaltstext |
| 856 | 4 | 2 | |m X:MVB |u http://www.dr.hut-verlag.de/978-3-8439-3434-3.html |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-030284732 | |
Datensatz im Suchindex
| _version_ | 1818984089144786944 |
|---|---|
| any_adam_object | |
| author | Hopf, Michael |
| author_GND | (DE-588)1137876603 |
| author_facet | Hopf, Michael |
| author_role | aut |
| author_sort | Hopf, Michael |
| author_variant | m h mh |
| building | Verbundindex |
| bvnumber | BV044890725 |
| ctrlnum | (OCoLC)1027720854 (DE-599)DNB1151593583 |
| discipline | Mathematik |
| edition | 1. Auflage |
| format | Thesis Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02120nam a22005538c 4500</leader><controlfield tag="001">BV044890725</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20180419 </controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">180404s2018 gw |||| m||| 00||| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">18,N06</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">1151593583</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783843934343</subfield><subfield code="c">Hardcover kaschiert : EUR 72.00 (DE), EUR 74.10 (AT)</subfield><subfield code="9">978-3-8439-3434-3</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3843934347</subfield><subfield code="9">3-8439-3434-7</subfield></datafield><datafield tag="024" ind1="3" ind2=" "><subfield code="a">9783843934343</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1027720854</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB1151593583</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="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">XA-DE-BY</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-29</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">510</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Hopf, Michael</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1137876603</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Algorithms and Complexity for Scheduling and Packing Problems</subfield><subfield code="c">Michael Hopf</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1. Auflage</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">München</subfield><subfield code="b">Verlag Dr. Hut</subfield><subfield code="c">2018</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">xii, 171 Seiten</subfield><subfield code="b">Diagramme</subfield><subfield code="c">21 cm x 14.8 cm, 371 g</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="0" ind2=" "><subfield code="a">Mathematik</subfield></datafield><datafield tag="502" ind1=" " ind2=" "><subfield code="b">Dissertation</subfield><subfield code="c">Technische Universität Kaiserslautern</subfield><subfield code="d">2017</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Reihenfolgeproblem</subfield><subfield code="0">(DE-588)4242167-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Packungsproblem</subfield><subfield code="0">(DE-588)4173057-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Approximation</subfield><subfield code="0">(DE-588)4002498-2</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="653" ind1=" " ind2=" "><subfield code="a">Algorithms</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Complexity</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Approximation</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">Reihenfolgeproblem</subfield><subfield code="0">(DE-588)4242167-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Packungsproblem</subfield><subfield code="0">(DE-588)4173057-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Approximation</subfield><subfield code="0">(DE-588)4002498-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="3"><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=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="710" ind1="2" ind2=" "><subfield code="a">Verlag Dr. Hut (München)</subfield><subfield code="0">(DE-588)10174118-2</subfield><subfield code="4">pbl</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">X:MVB</subfield><subfield code="q">text/html</subfield><subfield code="u">http://deposit.dnb.de/cgi-bin/dokserv?id=f346662f0f65486d96b8d74880347284&prov=M&dok_var=1&dok_ext=htm</subfield><subfield code="3">Inhaltstext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">X:MVB</subfield><subfield code="u">http://www.dr.hut-verlag.de/978-3-8439-3434-3.html</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-030284732</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV044890725 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-20T18:13:27Z |
| institution | BVB |
| institution_GND | (DE-588)10174118-2 |
| isbn | 9783843934343 3843934347 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-030284732 |
| oclc_num | 1027720854 |
| open_access_boolean | |
| owner | DE-12 DE-19 DE-BY-UBM DE-29 |
| owner_facet | DE-12 DE-19 DE-BY-UBM DE-29 |
| physical | xii, 171 Seiten Diagramme 21 cm x 14.8 cm, 371 g |
| publishDate | 2018 |
| publishDateSearch | 2018 |
| publishDateSort | 2018 |
| publisher | Verlag Dr. Hut |
| record_format | marc |
| series2 | Mathematik |
| spelling | Hopf, Michael Verfasser (DE-588)1137876603 aut Algorithms and Complexity for Scheduling and Packing Problems Michael Hopf 1. Auflage München Verlag Dr. Hut 2018 xii, 171 Seiten Diagramme 21 cm x 14.8 cm, 371 g txt rdacontent n rdamedia nc rdacarrier Mathematik Dissertation Technische Universität Kaiserslautern 2017 Reihenfolgeproblem (DE-588)4242167-6 gnd rswk-swf Packungsproblem (DE-588)4173057-4 gnd rswk-swf Approximation (DE-588)4002498-2 gnd rswk-swf Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf Algorithms Complexity Approximation (DE-588)4113937-9 Hochschulschrift gnd-content Reihenfolgeproblem (DE-588)4242167-6 s Packungsproblem (DE-588)4173057-4 s Approximation (DE-588)4002498-2 s Komplexitätstheorie (DE-588)4120591-1 s DE-604 Verlag Dr. Hut (München) (DE-588)10174118-2 pbl X:MVB text/html http://deposit.dnb.de/cgi-bin/dokserv?id=f346662f0f65486d96b8d74880347284&prov=M&dok_var=1&dok_ext=htm Inhaltstext X:MVB http://www.dr.hut-verlag.de/978-3-8439-3434-3.html |
| spellingShingle | Hopf, Michael Algorithms and Complexity for Scheduling and Packing Problems Reihenfolgeproblem (DE-588)4242167-6 gnd Packungsproblem (DE-588)4173057-4 gnd Approximation (DE-588)4002498-2 gnd Komplexitätstheorie (DE-588)4120591-1 gnd |
| subject_GND | (DE-588)4242167-6 (DE-588)4173057-4 (DE-588)4002498-2 (DE-588)4120591-1 (DE-588)4113937-9 |
| title | Algorithms and Complexity for Scheduling and Packing Problems |
| title_auth | Algorithms and Complexity for Scheduling and Packing Problems |
| title_exact_search | Algorithms and Complexity for Scheduling and Packing Problems |
| title_full | Algorithms and Complexity for Scheduling and Packing Problems Michael Hopf |
| title_fullStr | Algorithms and Complexity for Scheduling and Packing Problems Michael Hopf |
| title_full_unstemmed | Algorithms and Complexity for Scheduling and Packing Problems Michael Hopf |
| title_short | Algorithms and Complexity for Scheduling and Packing Problems |
| title_sort | algorithms and complexity for scheduling and packing problems |
| topic | Reihenfolgeproblem (DE-588)4242167-6 gnd Packungsproblem (DE-588)4173057-4 gnd Approximation (DE-588)4002498-2 gnd Komplexitätstheorie (DE-588)4120591-1 gnd |
| topic_facet | Reihenfolgeproblem Packungsproblem Approximation Komplexitätstheorie Hochschulschrift |
| url | http://deposit.dnb.de/cgi-bin/dokserv?id=f346662f0f65486d96b8d74880347284&prov=M&dok_var=1&dok_ext=htm http://www.dr.hut-verlag.de/978-3-8439-3434-3.html |
| work_keys_str_mv | AT hopfmichael algorithmsandcomplexityforschedulingandpackingproblems AT verlagdrhutmunchen algorithmsandcomplexityforschedulingandpackingproblems |