Approximation and randomization in scheduling:
Saved in:
| Main Author: | |
|---|---|
| Format: | Thesis Book |
| Language: | English |
| Published: |
Göttingen
Cuvillier
1998
|
| Edition: | 1. Aufl. |
| Subjects: | |
| Online Access: | Inhaltsverzeichnis |
| Physical Description: | VII, 156 S. graph. Darst. : 21 cm |
| ISBN: | 3897122405 |
Staff View
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV019574721 | ||
| 003 | DE-604 | ||
| 005 | 20150420 | ||
| 007 | t | ||
| 008 | 041108s1998 gw d||| m||| 00||| eng d | ||
| 016 | 7 | |a 954376501 |2 DE-101 | |
| 020 | |a 3897122405 |c kart. : DM 54.00, sfr 54.00, S 378.00 |9 3-89712-240-5 | ||
| 035 | |a (OCoLC)47317999 | ||
| 035 | |a (DE-599)BVBBV019574721 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c DE | ||
| 049 | |a DE-83 | ||
| 084 | |a SK 970 |0 (DE-625)143276: |2 rvk | ||
| 084 | |a 90B35 |2 msc | ||
| 100 | 1 | |a Skutella, Martin |d 1969- |e Verfasser |0 (DE-588)120825627 |4 aut | |
| 245 | 1 | 0 | |a Approximation and randomization in scheduling |c vorgelegt von Martin Skutella |
| 250 | |a 1. Aufl. | ||
| 264 | 1 | |a Göttingen |b Cuvillier |c 1998 | |
| 300 | |a VII, 156 S. |b graph. Darst. : 21 cm | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 502 | |a Zugl.: Berlin, Techn. Univ., Diss., 1998 | ||
| 650 | 7 | |a Hochschulschrift |2 gtt | |
| 650 | 0 | 7 | |a NP-hartes Problem |0 (DE-588)4621705-8 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Reihenfolgeproblem |0 (DE-588)4242167-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Polynomialzeitalgorithmus |0 (DE-588)4199652-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Approximation |0 (DE-588)4002498-2 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Relaxationsmethode |0 (DE-588)4451085-8 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Effizienter Algorithmus |0 (DE-588)4125422-3 |2 gnd |9 rswk-swf |
| 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 NP-hartes Problem |0 (DE-588)4621705-8 |D s |
| 689 | 0 | 2 | |a Approximation |0 (DE-588)4002498-2 |D s |
| 689 | 0 | 3 | |a Effizienter Algorithmus |0 (DE-588)4125422-3 |D s |
| 689 | 0 | 4 | |a Relaxationsmethode |0 (DE-588)4451085-8 |D s |
| 689 | 0 | 5 | |a Polynomialzeitalgorithmus |0 (DE-588)4199652-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 856 | 4 | 2 | |m DNB Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=012914291&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-012914291 | ||
Record in the Search Index
| _version_ | 1804132932073291776 |
|---|---|
| any_adam_object | 1 |
| author | Skutella, Martin 1969- |
| author_GND | (DE-588)120825627 |
| author_facet | Skutella, Martin 1969- |
| author_role | aut |
| author_sort | Skutella, Martin 1969- |
| author_variant | m s ms |
| building | Verbundindex |
| bvnumber | BV019574721 |
| classification_rvk | SK 970 |
| ctrlnum | (OCoLC)47317999 (DE-599)BVBBV019574721 |
| discipline | Mathematik |
| edition | 1. Aufl. |
| format | Thesis Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02152nam a2200517 c 4500</leader><controlfield tag="001">BV019574721</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20150420 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">041108s1998 gw d||| m||| 00||| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">954376501</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3897122405</subfield><subfield code="c">kart. : DM 54.00, sfr 54.00, S 378.00</subfield><subfield code="9">3-89712-240-5</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)47317999</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV019574721</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</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">DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-83</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 970</subfield><subfield code="0">(DE-625)143276:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">90B35</subfield><subfield code="2">msc</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Skutella, Martin</subfield><subfield code="d">1969-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)120825627</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Approximation and randomization in scheduling</subfield><subfield code="c">vorgelegt von Martin Skutella</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1. Aufl.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Göttingen</subfield><subfield code="b">Cuvillier</subfield><subfield code="c">1998</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">VII, 156 S.</subfield><subfield code="b">graph. Darst. : 21 cm</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">Zugl.: Berlin, Techn. Univ., Diss., 1998</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Hochschulschrift</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">NP-hartes Problem</subfield><subfield code="0">(DE-588)4621705-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</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">Polynomialzeitalgorithmus</subfield><subfield code="0">(DE-588)4199652-5</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">Relaxationsmethode</subfield><subfield code="0">(DE-588)4451085-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Effizienter Algorithmus</subfield><subfield code="0">(DE-588)4125422-3</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">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">NP-hartes Problem</subfield><subfield code="0">(DE-588)4621705-8</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">Effizienter Algorithmus</subfield><subfield code="0">(DE-588)4125422-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="4"><subfield code="a">Relaxationsmethode</subfield><subfield code="0">(DE-588)4451085-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="5"><subfield code="a">Polynomialzeitalgorithmus</subfield><subfield code="0">(DE-588)4199652-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">DNB Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=012914291&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-012914291</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV019574721 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T20:00:40Z |
| institution | BVB |
| isbn | 3897122405 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-012914291 |
| oclc_num | 47317999 |
| open_access_boolean | |
| owner | DE-83 |
| owner_facet | DE-83 |
| physical | VII, 156 S. graph. Darst. : 21 cm |
| publishDate | 1998 |
| publishDateSearch | 1998 |
| publishDateSort | 1998 |
| publisher | Cuvillier |
| record_format | marc |
| spelling | Skutella, Martin 1969- Verfasser (DE-588)120825627 aut Approximation and randomization in scheduling vorgelegt von Martin Skutella 1. Aufl. Göttingen Cuvillier 1998 VII, 156 S. graph. Darst. : 21 cm txt rdacontent n rdamedia nc rdacarrier Zugl.: Berlin, Techn. Univ., Diss., 1998 Hochschulschrift gtt NP-hartes Problem (DE-588)4621705-8 gnd rswk-swf Reihenfolgeproblem (DE-588)4242167-6 gnd rswk-swf Polynomialzeitalgorithmus (DE-588)4199652-5 gnd rswk-swf Approximation (DE-588)4002498-2 gnd rswk-swf Relaxationsmethode (DE-588)4451085-8 gnd rswk-swf Effizienter Algorithmus (DE-588)4125422-3 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Reihenfolgeproblem (DE-588)4242167-6 s NP-hartes Problem (DE-588)4621705-8 s Approximation (DE-588)4002498-2 s Effizienter Algorithmus (DE-588)4125422-3 s Relaxationsmethode (DE-588)4451085-8 s Polynomialzeitalgorithmus (DE-588)4199652-5 s DE-604 DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=012914291&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Skutella, Martin 1969- Approximation and randomization in scheduling Hochschulschrift gtt NP-hartes Problem (DE-588)4621705-8 gnd Reihenfolgeproblem (DE-588)4242167-6 gnd Polynomialzeitalgorithmus (DE-588)4199652-5 gnd Approximation (DE-588)4002498-2 gnd Relaxationsmethode (DE-588)4451085-8 gnd Effizienter Algorithmus (DE-588)4125422-3 gnd |
| subject_GND | (DE-588)4621705-8 (DE-588)4242167-6 (DE-588)4199652-5 (DE-588)4002498-2 (DE-588)4451085-8 (DE-588)4125422-3 (DE-588)4113937-9 |
| title | Approximation and randomization in scheduling |
| title_auth | Approximation and randomization in scheduling |
| title_exact_search | Approximation and randomization in scheduling |
| title_full | Approximation and randomization in scheduling vorgelegt von Martin Skutella |
| title_fullStr | Approximation and randomization in scheduling vorgelegt von Martin Skutella |
| title_full_unstemmed | Approximation and randomization in scheduling vorgelegt von Martin Skutella |
| title_short | Approximation and randomization in scheduling |
| title_sort | approximation and randomization in scheduling |
| topic | Hochschulschrift gtt NP-hartes Problem (DE-588)4621705-8 gnd Reihenfolgeproblem (DE-588)4242167-6 gnd Polynomialzeitalgorithmus (DE-588)4199652-5 gnd Approximation (DE-588)4002498-2 gnd Relaxationsmethode (DE-588)4451085-8 gnd Effizienter Algorithmus (DE-588)4125422-3 gnd |
| topic_facet | Hochschulschrift NP-hartes Problem Reihenfolgeproblem Polynomialzeitalgorithmus Approximation Relaxationsmethode Effizienter Algorithmus |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=012914291&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT skutellamartin approximationandrandomizationinscheduling |