Algorithms for mixed-integer bilevel problems with convex followers:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Abschlussarbeit Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Erlangen ; Nürnberg
Friedrich-Alexander-Universität Erlangen-Nürnberg
2021
|
| Schlagworte: | |
| Online-Zugang: | Volltext Volltext Volltext |
| Beschreibung: | 1 Online-Ressource Illustrationen, Diagramme |
Internformat
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV047267150 | ||
| 003 | DE-604 | ||
| 005 | 20211124 | ||
| 006 | a m||| 00||| | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 210504s2021 gw |||| o||u| ||||||eng d | ||
| 015 | |a 21,O05 |2 dnb | ||
| 016 | 7 | |a 1232075817 |2 DE-101 | |
| 024 | 7 | |a urn:nbn:de:bvb:29-opus4-162259 |2 urn | |
| 035 | |a (OCoLC)1249664300 | ||
| 035 | |a (DE-599)DNB1232075817 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |8 3\p |a eng | |
| 044 | |a gw |c XA-DE-BY | ||
| 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 |a DE-860 |a DE-2174 | ||
| 084 | |8 1\p |a 519.7 |2 23ksdnb | ||
| 084 | |8 2\p |a 510 |2 23sdnb | ||
| 100 | 1 | |a Kleinert, Thomas |0 (DE-588)1203308485 |4 aut | |
| 245 | 1 | 0 | |a Algorithms for mixed-integer bilevel problems with convex followers |c vorgelegt von Thomas Kleinert |
| 246 | 1 | 3 | |a Algorithmen für gemischt-ganzzahlige zweistufige Optimierungsprobleme mit konvexer unterer Stufe |
| 264 | 1 | |a Erlangen ; Nürnberg |b Friedrich-Alexander-Universität Erlangen-Nürnberg |c 2021 | |
| 300 | |a 1 Online-Ressource |b Illustrationen, Diagramme | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 502 | |b Dissertation |c Friedrich-Alexander-Universität Erlangen-Nürnberg |d 2021 | ||
| 583 | 1 | |a Archivierung/Langzeitarchivierung gewährleistet |5 DE-101 |2 pdager | |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Gemischt-ganzzahlige Optimierung |0 (DE-588)4156566-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |8 4\p |a Algorithms |0 (DLC)sh85003487 |0 http://id.loc.gov/authorities/subjects/sh85003487 |2 lcsh |
| 653 | |a Mixed-integer optimization | ||
| 653 | |a bilevel optimization | ||
| 653 | |a nonlinear optimization | ||
| 653 | |a computational optimization | ||
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | 1 | |a Gemischt-ganzzahlige Optimierung |0 (DE-588)4156566-6 |D s |
| 689 | 0 | |5 DE-604 | |
| 856 | 4 | 0 | |u https://nbn-resolving.org/urn:nbn:de:bvb:29-opus4-162259 |x Resolving-System |z kostenfrei |3 Volltext |
| 856 | 4 | 0 | |u https://d-nb.info/1232075817/34 |x Langzeitarchivierung Nationalbibliothek |z kostenfrei |3 Volltext |
| 856 | 4 | 0 | |q application/pdf |u https://open.fau.de/handle/openfau/16225 |x Verlag |z kostenfrei |3 Volltext |
| 912 | |a ebook | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-032670901 | ||
| 883 | 0 | |8 1\p |a aepkn |c 0,99918 |d 20210424 |q DE-101 |u https://d-nb.info/provenance/plan#aepkn | |
| 883 | 0 | |8 2\p |a aepsg |c 0,99801 |d 20210424 |q DE-101 |u https://d-nb.info/provenance/plan#aepsg | |
| 883 | 1 | |8 3\p |a npi |d 20210423 |q DE-101 |u https://d-nb.info/provenance/plan#npi | |
| 883 | 0 | |8 4\p |a aeplcsh |c 0,01948 |d 20210424 |q DE-101 |u https://d-nb.info/provenance/plan#aeplcsh | |
Datensatz im Suchindex
| _version_ | 1804182421162164224 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Kleinert, Thomas |
| author_GND | (DE-588)1203308485 |
| author_facet | Kleinert, Thomas |
| author_role | aut |
| author_sort | Kleinert, Thomas |
| author_variant | t k tk |
| building | Verbundindex |
| bvnumber | BV047267150 |
| collection | ebook |
| ctrlnum | (OCoLC)1249664300 (DE-599)DNB1232075817 |
| format | Thesis Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02818nmm a2200589zc 4500</leader><controlfield tag="001">BV047267150</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20211124 </controlfield><controlfield tag="006">a m||| 00||| </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">210504s2021 gw |||| o||u| ||||||eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">21,O05</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">1232075817</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">urn:nbn:de:bvb:29-opus4-162259</subfield><subfield code="2">urn</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1249664300</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB1232075817</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="8">3\p</subfield><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-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><subfield code="a">DE-860</subfield><subfield code="a">DE-2174</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="8">1\p</subfield><subfield code="a">519.7</subfield><subfield code="2">23ksdnb</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="8">2\p</subfield><subfield code="a">510</subfield><subfield code="2">23sdnb</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Kleinert, Thomas</subfield><subfield code="0">(DE-588)1203308485</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Algorithms for mixed-integer bilevel problems with convex followers</subfield><subfield code="c">vorgelegt von Thomas Kleinert</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">Algorithmen für gemischt-ganzzahlige zweistufige Optimierungsprobleme mit konvexer unterer Stufe</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Erlangen ; Nürnberg</subfield><subfield code="b">Friedrich-Alexander-Universität Erlangen-Nürnberg</subfield><subfield code="c">2021</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource</subfield><subfield code="b">Illustrationen, 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">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="502" ind1=" " ind2=" "><subfield code="b">Dissertation</subfield><subfield code="c">Friedrich-Alexander-Universität Erlangen-Nürnberg</subfield><subfield code="d">2021</subfield></datafield><datafield tag="583" ind1="1" ind2=" "><subfield code="a">Archivierung/Langzeitarchivierung gewährleistet</subfield><subfield code="5">DE-101</subfield><subfield code="2">pdager</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Gemischt-ganzzahlige Optimierung</subfield><subfield code="0">(DE-588)4156566-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="8">4\p</subfield><subfield code="a">Algorithms</subfield><subfield code="0">(DLC)sh85003487</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85003487</subfield><subfield code="2">lcsh</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Mixed-integer optimization</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">bilevel optimization</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">nonlinear optimization</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">computational optimization</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">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Gemischt-ganzzahlige Optimierung</subfield><subfield code="0">(DE-588)4156566-6</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="0"><subfield code="u">https://nbn-resolving.org/urn:nbn:de:bvb:29-opus4-162259</subfield><subfield code="x">Resolving-System</subfield><subfield code="z">kostenfrei</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://d-nb.info/1232075817/34</subfield><subfield code="x">Langzeitarchivierung Nationalbibliothek</subfield><subfield code="z">kostenfrei</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="q">application/pdf</subfield><subfield code="u">https://open.fau.de/handle/openfau/16225</subfield><subfield code="x">Verlag</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-032670901</subfield></datafield><datafield tag="883" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">aepkn</subfield><subfield code="c">0,99918</subfield><subfield code="d">20210424</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#aepkn</subfield></datafield><datafield tag="883" ind1="0" ind2=" "><subfield code="8">2\p</subfield><subfield code="a">aepsg</subfield><subfield code="c">0,99801</subfield><subfield code="d">20210424</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#aepsg</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">3\p</subfield><subfield code="a">npi</subfield><subfield code="d">20210423</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#npi</subfield></datafield><datafield tag="883" ind1="0" ind2=" "><subfield code="8">4\p</subfield><subfield code="a">aeplcsh</subfield><subfield code="c">0,01948</subfield><subfield code="d">20210424</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#aeplcsh</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV047267150 |
| illustrated | Not Illustrated |
| index_date | 2024-07-03T17:13:01Z |
| indexdate | 2024-07-10T09:07:17Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-032670901 |
| oclc_num | 1249664300 |
| 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 DE-860 DE-2174 |
| 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 DE-860 DE-2174 |
| physical | 1 Online-Ressource Illustrationen, Diagramme |
| psigel | ebook |
| publishDate | 2021 |
| publishDateSearch | 2021 |
| publishDateSort | 2021 |
| publisher | Friedrich-Alexander-Universität Erlangen-Nürnberg |
| record_format | marc |
| spelling | Kleinert, Thomas (DE-588)1203308485 aut Algorithms for mixed-integer bilevel problems with convex followers vorgelegt von Thomas Kleinert Algorithmen für gemischt-ganzzahlige zweistufige Optimierungsprobleme mit konvexer unterer Stufe Erlangen ; Nürnberg Friedrich-Alexander-Universität Erlangen-Nürnberg 2021 1 Online-Ressource Illustrationen, Diagramme txt rdacontent c rdamedia cr rdacarrier Dissertation Friedrich-Alexander-Universität Erlangen-Nürnberg 2021 Archivierung/Langzeitarchivierung gewährleistet DE-101 pdager Algorithmus (DE-588)4001183-5 gnd rswk-swf Gemischt-ganzzahlige Optimierung (DE-588)4156566-6 gnd rswk-swf 4\p Algorithms (DLC)sh85003487 http://id.loc.gov/authorities/subjects/sh85003487 lcsh Mixed-integer optimization bilevel optimization nonlinear optimization computational optimization (DE-588)4113937-9 Hochschulschrift gnd-content Algorithmus (DE-588)4001183-5 s Gemischt-ganzzahlige Optimierung (DE-588)4156566-6 s DE-604 https://nbn-resolving.org/urn:nbn:de:bvb:29-opus4-162259 Resolving-System kostenfrei Volltext https://d-nb.info/1232075817/34 Langzeitarchivierung Nationalbibliothek kostenfrei Volltext application/pdf https://open.fau.de/handle/openfau/16225 Verlag kostenfrei Volltext 1\p aepkn 0,99918 20210424 DE-101 https://d-nb.info/provenance/plan#aepkn 2\p aepsg 0,99801 20210424 DE-101 https://d-nb.info/provenance/plan#aepsg 3\p npi 20210423 DE-101 https://d-nb.info/provenance/plan#npi 4\p aeplcsh 0,01948 20210424 DE-101 https://d-nb.info/provenance/plan#aeplcsh |
| spellingShingle | Kleinert, Thomas Algorithms for mixed-integer bilevel problems with convex followers Algorithmus (DE-588)4001183-5 gnd Gemischt-ganzzahlige Optimierung (DE-588)4156566-6 gnd 4\p Algorithms (DLC)sh85003487 http://id.loc.gov/authorities/subjects/sh85003487 lcsh |
| subject_GND | (DE-588)4001183-5 (DE-588)4156566-6 (DLC)sh85003487 http://id.loc.gov/authorities/subjects/sh85003487 (DE-588)4113937-9 |
| title | Algorithms for mixed-integer bilevel problems with convex followers |
| title_alt | Algorithmen für gemischt-ganzzahlige zweistufige Optimierungsprobleme mit konvexer unterer Stufe |
| title_auth | Algorithms for mixed-integer bilevel problems with convex followers |
| title_exact_search | Algorithms for mixed-integer bilevel problems with convex followers |
| title_exact_search_txtP | Algorithms for mixed-integer bilevel problems with convex followers |
| title_full | Algorithms for mixed-integer bilevel problems with convex followers vorgelegt von Thomas Kleinert |
| title_fullStr | Algorithms for mixed-integer bilevel problems with convex followers vorgelegt von Thomas Kleinert |
| title_full_unstemmed | Algorithms for mixed-integer bilevel problems with convex followers vorgelegt von Thomas Kleinert |
| title_short | Algorithms for mixed-integer bilevel problems with convex followers |
| title_sort | algorithms for mixed integer bilevel problems with convex followers |
| topic | Algorithmus (DE-588)4001183-5 gnd Gemischt-ganzzahlige Optimierung (DE-588)4156566-6 gnd 4\p Algorithms (DLC)sh85003487 http://id.loc.gov/authorities/subjects/sh85003487 lcsh |
| topic_facet | Algorithmus Gemischt-ganzzahlige Optimierung Algorithms Hochschulschrift |
| url | https://nbn-resolving.org/urn:nbn:de:bvb:29-opus4-162259 https://d-nb.info/1232075817/34 https://open.fau.de/handle/openfau/16225 |
| work_keys_str_mv | AT kleinertthomas algorithmsformixedintegerbilevelproblemswithconvexfollowers AT kleinertthomas algorithmenfurgemischtganzzahligezweistufigeoptimierungsproblememitkonvexeruntererstufe |