Integer and combinatorial optimization:
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
New York ; Chichester ; Weinheim ; Brisbane ; Singapore ; Toronto
John Wiley & Sons, inc
[1999]
|
| Schriftenreihe: | Wiley-Interscience series in discrete mathematics and optimization
|
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | Hier auch später erschienene, unveränderte Nachdrucke |
| Beschreibung: | xiv, 763 Seiten Illustrationen |
| ISBN: | 0471359432 047182819X 9780471359432 9781118627259 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV012976379 | ||
| 003 | DE-604 | ||
| 005 | 20230628 | ||
| 007 | t | ||
| 008 | 000208s1999 a||| |||| 00||| eng d | ||
| 020 | |a 0471359432 |c Pb.: £ 122.00 |9 0-471-35943-2 | ||
| 020 | |a 047182819X |9 0-471-82819-X | ||
| 020 | |a 9780471359432 |c print |9 978-0-471-35943-2 | ||
| 020 | |a 9781118627259 |c online |9 978-1-118-62725-9 | ||
| 035 | |a (OCoLC)264955753 | ||
| 035 | |a (DE-599)BVBBV012976379 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91 |a DE-91G |a DE-20 |a DE-29T |a DE-703 |a DE-863 |a DE-824 |a DE-634 |a DE-11 |a DE-83 |a DE-2070s |a DE-92 |a DE-706 |a DE-521 |a DE-739 | ||
| 082 | 0 | |a 519.77 |2 21 | |
| 084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
| 084 | |a QH 422 |0 (DE-625)141576: |2 rvk | ||
| 084 | |a QH 425 |0 (DE-625)141579: |2 rvk | ||
| 084 | |a MAT 913f |2 stub | ||
| 084 | |a 90C10 |2 msc | ||
| 084 | |a MAT 052f |2 stub | ||
| 100 | 1 | |a Nemhauser, George L. |d 1937- |0 (DE-588)11091340X |4 aut | |
| 245 | 1 | 0 | |a Integer and combinatorial optimization |c George Nemhauser (School of Industrial and Systems Engineering Georgia Institute of Technology, Atlanta, Georigia), Laurence A. Wolsey (Center for Operations Research and Econometrics Unversité Catholique de Louvain, Louvain-la-Neuve, Belgien) |
| 264 | 1 | |a New York ; Chichester ; Weinheim ; Brisbane ; Singapore ; Toronto |b John Wiley & Sons, inc |c [1999] | |
| 264 | 4 | |c © 1999 | |
| 300 | |a xiv, 763 Seiten |b Illustrationen | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a Wiley-Interscience series in discrete mathematics and optimization | |
| 500 | |a Hier auch später erschienene, unveränderte Nachdrucke | ||
| 650 | 4 | |a Combinatorial optimization | |
| 650 | 4 | |a Integer programming | |
| 650 | 0 | 7 | |a Kombinatorische Optimierung |0 (DE-588)4031826-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Diskrete Optimierung |0 (DE-588)4150179-2 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Ganzzahlige Optimierung |0 (DE-588)4155950-2 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Ganzzahlige Optimierung |0 (DE-588)4155950-2 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Kombinatorische Optimierung |0 (DE-588)4031826-6 |D s |
| 689 | 1 | |5 DE-604 | |
| 689 | 2 | 0 | |a Diskrete Optimierung |0 (DE-588)4150179-2 |D s |
| 689 | 2 | |8 1\p |5 DE-604 | |
| 700 | 1 | |a Wolsey, Laurence A. |d 1945- |0 (DE-588)129756326 |4 aut | |
| 776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |z 978-1-118-62725-9 |
| 856 | 4 | 2 | |m Digitalisierung UB Passau - ADAM Catalogue Enrichment |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=008840691&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-008840691 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Datensatz im Suchindex
| DE-BY-863_location | 1000 |
|---|---|
| DE-BY-FWS_call_number | 1000/SK 890 N433 |
| DE-BY-FWS_katkey | 257716 |
| DE-BY-FWS_media_number | 083100859837 |
| _version_ | 1806174168320835584 |
| adam_text | Contents PARTI. 1.1 The Scope of Integer and Combinatorial Optimization 1. 2. 3. 4. 5. 6. 7. 8. 1.2 Introduction Duality The Primal and Dual Simplex Algorithms Subgradient Optimization Notes Graphs and Networks 1. 2. 3. 4. 5. 6. 7. 1.4 Introduction Modeling with Binary Variables I: Knapsack, Assignment and Matching, Covering, Packing and Partitioning 5 Modeling with Binary Variables II: Facility Location, Fixed-Charge Network Flow, and Traveling Salesman 7 Modeling with Binary Variables III: Nonlinear Functions and Disjunctive Constraints Choices in Model Formulation Preprocessing Notes Exercises Linear Programming 1. 2. 3. 4. 5. 13 FOUNDATIONS Introduction The Minimum-Weight or Shortest-Path Problem The Minimum-Weight Spanning Tree Problem The Maximum-Flow and Minimum-Cut Problems The Transportation Problem: A Primal-Dual Algorithm A Primal Simplex Algorithm for Network Flow Problems Notes Polyhedral Theory 1. 2. 3. 4. 5. Introduction and Elementary Linear Algebra Definitions ofPolyhedra and Dimension Describing Polyhedra by Facets Describing Polyhedra by Extreme Points and Extreme Rays Polarity 1 3 3 10 14 17 20 22 27 27 28 30 41 49 50 50 55 60 62 68 76 82 83 83 85 88 92 98 xi
Contents xii 6. 7. 8. 1.5 1.6 114 1. 2. 3. 4. 5. 6. 7. 8. 9. 114 117 121 125 127 131 139 142 143 Introduction Measuring Algorithm Efficiency and Problem Complexity Some Problems Solvable in Polynomial Time Remarks on 0-1 and Pure-Integer Programming Nondeterministic Polynomial-Time Algorithms and A՞^ Problems The Most Difficult.W Problems: The Class Я^ Complexity and Polyhedra Notes Exercises Polynomial-Time Algorithmsfor Linear Programming Introduction The Ellipsoid Algorithm The Polynomial Equivalence of Separation and Optimization A Projective Algorithm A Strongly Polynomial Algorithm for Combinatorial Linear Programs Notes Integer Lattices 1. 2. 3. 4. 5. 6. 7. Introduction The Euclidean Algorithm Continued Fractions Lattices and Hermite Normal Form Reduced Bases Notes Exercises PARTII. П.1 104 109 109 Computational Complexity 1. 2. 3. 4. 5. 6. 1.7 Polyhedral Ties BetweenLinear and Integer Programs Notes Exercises GENERAL INTEGER PROGRAMMING 146 146 147 161 164 172 180 182 182 184 187 189 195 201 202 203 The Theory of Valid Inequalities 205 1. Introduction 2. Generating All Valid Inequalities 3. Gomory’s Fractional Cuts and Rounding 4. Superadditive Functions and Valid Inequalities 5. A Polyhedral Description of Superadditive Valid Inequalities for Independence Systems 6. Valid Inequalities for Mixed-Integer Sets 7. Superadditivity for Mixed-Integer Sets 8. Notes 9. Exercises 205 217 227 229 237 242 246 254 256
Contents xiii II.2 Strong Valid Inequalities and Facets for Structured Integer Programs II.3 1. Introduction 2. Valid Inequalities for the 0-1 Knapsack Polytope 3. Valid Inequalities for the Symmetric Traveling Salesman Polytope 4. Valid Inequalities for Variable Upper-Bound Flow Models 5. Notes 6. Exercises 259 265 270 281 290 291 Duality and Relaxation 296 1. 2. 3. 4. 5. 6. 7. 8. 9. II.4 II.5 Introduction Duality and the Value Function Superadditive Duality The Maximum-Weight Path Formulation and Superadditive Duality Modular Arithmetic and the Group Problem Lagrangian Relaxation and Duality Benders’ Reformulation Notes Exercises 296 300 304 308 312 323 337 341 343 General Algorithms 349 1. Introduction 2. Branch-and-Bound Using Linear Programming Relaxations 3. General Cutting-Plane Algorithms 4. Notes 5. Exercises 349 355 367 379 381 Special-Purpose Algorithms 383 1. 2. 3. 4. 5. 6. 7. II.6 259 Introduction A Cutting-Plane Algorithm Using Strong Valid Inequalities Primal and Dual Heuristic Algorithms Decomposition Algorithms Dynamic Programming Notes Exercises Applicationsof Special-Purpose Algorithms 1. 2. 3. 4. 5. 6. 7. Knapsack and Group Problems 0-1 Integer Programming Problems The Symmetric Traveling Salesman Problem Fixed-Charge Network Flow Problems Applications of Basis Reduction Notes Exercises 383 386 393 409 417 424 427 433 433 456 469 495 513 520 526
xiv Contents PARTIIL COMBINATORIAL OPTIMIZATION IILI Integral Polyhedra 1. 2. 3. 4. 5. 6. 7. 8. IIL2 IIL3 Introduction Totally Unimodular Matrices Network Matrices Balanced and Totally Balanced Matrices Node Packing and Perfect Graphs Blocking and Integral Polyhedra Notes Exercises 533 535 535 540 546 562 573 586 598 602 Matching 608 1. Introduction 2. Maximum-Cardinality Matching 3. Maximum-Weight Matching 4. Additional Results on Matching and Related Problems 5. Notes 6. Exercises 608 611 627 636 654 655 Matroid and Submodular Function Optimization 659 1, 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. Introduction Elementary Properties Maximum-Weight Independent Sets Matroid Intersection Weighted Matroid Intersection Polymatroids, Separation, and Submodular Function Minimization Algorithms To Minimize a Submodular Function Covering with Independent Sets and Matroid Partition Submodular Function Maximization Notes Exercises 659 662 666 671 678 688 694 702 708 712 714 References 721 Author Index 749 Subject Index 755
|
| any_adam_object | 1 |
| author | Nemhauser, George L. 1937- Wolsey, Laurence A. 1945- |
| author_GND | (DE-588)11091340X (DE-588)129756326 |
| author_facet | Nemhauser, George L. 1937- Wolsey, Laurence A. 1945- |
| author_role | aut aut |
| author_sort | Nemhauser, George L. 1937- |
| author_variant | g l n gl gln l a w la law |
| building | Verbundindex |
| bvnumber | BV012976379 |
| classification_rvk | SK 890 QH 422 QH 425 |
| classification_tum | MAT 913f MAT 052f |
| ctrlnum | (OCoLC)264955753 (DE-599)BVBBV012976379 |
| dewey-full | 519.77 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 519 - Probabilities and applied mathematics |
| dewey-raw | 519.77 |
| dewey-search | 519.77 |
| dewey-sort | 3519.77 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik Wirtschaftswissenschaften |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02806nam a2200589 c 4500</leader><controlfield tag="001">BV012976379</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20230628 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">000208s1999 a||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0471359432</subfield><subfield code="c">Pb.: £ 122.00</subfield><subfield code="9">0-471-35943-2</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">047182819X</subfield><subfield code="9">0-471-82819-X</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780471359432</subfield><subfield code="c">print</subfield><subfield code="9">978-0-471-35943-2</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781118627259</subfield><subfield code="c">online</subfield><subfield code="9">978-1-118-62725-9</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)264955753</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV012976379</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-91</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-863</subfield><subfield code="a">DE-824</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-2070s</subfield><subfield code="a">DE-92</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-521</subfield><subfield code="a">DE-739</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">519.77</subfield><subfield code="2">21</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">QH 422</subfield><subfield code="0">(DE-625)141576:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">QH 425</subfield><subfield code="0">(DE-625)141579:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 913f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">90C10</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 052f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Nemhauser, George L.</subfield><subfield code="d">1937-</subfield><subfield code="0">(DE-588)11091340X</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Integer and combinatorial optimization</subfield><subfield code="c">George Nemhauser (School of Industrial and Systems Engineering Georgia Institute of Technology, Atlanta, Georigia), Laurence A. Wolsey (Center for Operations Research and Econometrics Unversité Catholique de Louvain, Louvain-la-Neuve, Belgien)</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York ; Chichester ; Weinheim ; Brisbane ; Singapore ; Toronto</subfield><subfield code="b">John Wiley & Sons, inc</subfield><subfield code="c">[1999]</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">© 1999</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">xiv, 763 Seiten</subfield><subfield code="b">Illustrationen</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">Wiley-Interscience series in discrete mathematics and optimization</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Hier auch später erschienene, unveränderte Nachdrucke</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorial optimization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Integer programming</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Kombinatorische Optimierung</subfield><subfield code="0">(DE-588)4031826-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Diskrete Optimierung</subfield><subfield code="0">(DE-588)4150179-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Ganzzahlige Optimierung</subfield><subfield code="0">(DE-588)4155950-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Ganzzahlige Optimierung</subfield><subfield code="0">(DE-588)4155950-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Kombinatorische Optimierung</subfield><subfield code="0">(DE-588)4031826-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Diskrete Optimierung</subfield><subfield code="0">(DE-588)4150179-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wolsey, Laurence A.</subfield><subfield code="d">1945-</subfield><subfield code="0">(DE-588)129756326</subfield><subfield code="4">aut</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Online-Ausgabe</subfield><subfield code="z">978-1-118-62725-9</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UB Passau - ADAM Catalogue Enrichment</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=008840691&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-008840691</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield></record></collection> |
| id | DE-604.BV012976379 |
| illustrated | Illustrated |
| indexdate | 2024-08-01T10:45:15Z |
| institution | BVB |
| isbn | 0471359432 047182819X 9780471359432 9781118627259 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-008840691 |
| oclc_num | 264955753 |
| open_access_boolean | |
| owner | DE-91 DE-BY-TUM DE-91G DE-BY-TUM DE-20 DE-29T DE-703 DE-863 DE-BY-FWS DE-824 DE-634 DE-11 DE-83 DE-2070s DE-92 DE-706 DE-521 DE-739 |
| owner_facet | DE-91 DE-BY-TUM DE-91G DE-BY-TUM DE-20 DE-29T DE-703 DE-863 DE-BY-FWS DE-824 DE-634 DE-11 DE-83 DE-2070s DE-92 DE-706 DE-521 DE-739 |
| physical | xiv, 763 Seiten Illustrationen |
| publishDate | 1999 |
| publishDateSearch | 1999 |
| publishDateSort | 1999 |
| publisher | John Wiley & Sons, inc |
| record_format | marc |
| series2 | Wiley-Interscience series in discrete mathematics and optimization |
| spellingShingle | Nemhauser, George L. 1937- Wolsey, Laurence A. 1945- Integer and combinatorial optimization Combinatorial optimization Integer programming Kombinatorische Optimierung (DE-588)4031826-6 gnd Diskrete Optimierung (DE-588)4150179-2 gnd Ganzzahlige Optimierung (DE-588)4155950-2 gnd |
| subject_GND | (DE-588)4031826-6 (DE-588)4150179-2 (DE-588)4155950-2 |
| title | Integer and combinatorial optimization |
| title_auth | Integer and combinatorial optimization |
| title_exact_search | Integer and combinatorial optimization |
| title_full | Integer and combinatorial optimization George Nemhauser (School of Industrial and Systems Engineering Georgia Institute of Technology, Atlanta, Georigia), Laurence A. Wolsey (Center for Operations Research and Econometrics Unversité Catholique de Louvain, Louvain-la-Neuve, Belgien) |
| title_fullStr | Integer and combinatorial optimization George Nemhauser (School of Industrial and Systems Engineering Georgia Institute of Technology, Atlanta, Georigia), Laurence A. Wolsey (Center for Operations Research and Econometrics Unversité Catholique de Louvain, Louvain-la-Neuve, Belgien) |
| title_full_unstemmed | Integer and combinatorial optimization George Nemhauser (School of Industrial and Systems Engineering Georgia Institute of Technology, Atlanta, Georigia), Laurence A. Wolsey (Center for Operations Research and Econometrics Unversité Catholique de Louvain, Louvain-la-Neuve, Belgien) |
| title_short | Integer and combinatorial optimization |
| title_sort | integer and combinatorial optimization |
| topic | Combinatorial optimization Integer programming Kombinatorische Optimierung (DE-588)4031826-6 gnd Diskrete Optimierung (DE-588)4150179-2 gnd Ganzzahlige Optimierung (DE-588)4155950-2 gnd |
| topic_facet | Combinatorial optimization Integer programming Kombinatorische Optimierung Diskrete Optimierung Ganzzahlige Optimierung |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=008840691&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT nemhausergeorgel integerandcombinatorialoptimization AT wolseylaurencea integerandcombinatorialoptimization |
Inhaltsverzeichnis
THWS Würzburg Zentralbibliothek Lesesaal
| Signatur: |
1000 SK 890 N433 |
|---|---|
| Exemplar 1 | ausleihbar Verfügbar Bestellen |