Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 93,86
Convertire valutaQuantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
Condizione: Sehr gut. Zustand: Sehr gut | Seiten: 390 | Sprache: Englisch | Produktart: Bücher.
Editore: Kluwer Academic Pub, Netherlands, 1994
ISBN 10: 0792327853 ISBN 13: 9780792327851
Lingua: Inglese
Da: RT Books, Wexford, PA, U.S.A.
EUR 90,14
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloHardcover. Condizione: Near Fine. No Jacket. PUBLISHER: Kluwer Academic Pub DATE/EDITION: 1994 BINDING: Hardbound, 390 pages DUST JACKET: No jacket BOOK CONDITION: Near fine, looks unread. Very clean, tight binding, unmarked text.
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 104,74
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloGebundene Ausgabe. Condizione: Sehr gut. Gebraucht - Sehr gut SG - Ungelesenes Mängelexemplar, gestempelt, mit leichten Lagerspuren - This book presents an in-depth study on advances in constructive approximation theory with recent problems on linear positive operators. State-of-the-art research in constructive approximation is treated with extensions to approximation results on linear positive operators in a post quantum and bivariate setting. Methods, techniques, and problems in approximation theory are demonstrated with applications to optimization, physics, and biology. Graduate students, research scientists and engineers working in mathematics, physics, and industry will broaden their understanding of operators essential to pure and applied mathematics. Topics discussed include: discrete operators, quantitative estimates, post-quantum calculus, integral operators, univariate Gruss-type inequalities for positive linear operators, bivariate operators of discrete and integral type, convergence of GBS operators.
Editore: Society for Industrial and Applied Mathematics, 1987
ISBN 10: 0898715369 ISBN 13: 9780898715361
Lingua: Inglese
Da: Mispah books, Redhill, SURRE, Regno Unito
EUR 92,86
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: Very Good. Very Good. book.
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 131,98
Convertire valutaQuantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
Da: BOOKWEST, Phoenix, AZ, U.S.A.
EUR 124,38
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloHardcover. Condizione: New. US SELLER SHIPS FAST FROM USA.
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
EUR 86,31
Convertire valutaQuantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: Mispah books, Redhill, SURRE, Regno Unito
EUR 125,85
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: New. New. book.
Da: Books Puddle, New York, NY, U.S.A.
EUR 155,28
Convertire valutaQuantità: 4 disponibili
Aggiungi al carrelloCondizione: New.
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 170,11
Convertire valutaQuantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 170,11
Convertire valutaQuantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
EUR 114,70
Convertire valutaQuantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Editore: Springer US, Springer New York, 2011
ISBN 10: 1461336317 ISBN 13: 9781461336310
Lingua: Inglese
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 164,49
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - 2. The Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 59 3. Convergence Analysis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . , . . . . 60 4. Complexity Analysis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 63 5. Conclusions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 67 References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 67 A Simple Proof for a Result of Ollerenshaw on Steiner Trees . . . . . . . . . . 68 Xiufeng Du, Ding-Zhu Du, Biao Gao, and Lixue Qii 1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 68 2. In the Euclidean Plane . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 69 3. In the Rectilinear Plane . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 70 4. Discussion . . . . . . . . . . . . -. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 71 References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 71 Optimization Algorithms for the Satisfiability (SAT) Problem . . . . . . . . . 72 Jun Gu 1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 72 2. A Classification of SAT Algorithms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7:3 3. Preliminaries . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . IV 4. Complete Algorithms and Incomplete Algorithms . . . . . . . . . . . . . . . . . . . . . . . . . . 81 5. Optimization: An Iterative Refinement Process . . . . . . . . . . . . . . . . . . . . . . . . . . . . 86 6. Local Search Algorithms for SAT . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 89 7. Global Optimization Algorithms for SAT Problem . . . . . . . . . . . . . . . . . . . . . . . . 106 8. Applications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 137 9. Future Work . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 140 10. Conclusions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 141 References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 143 Ergodic Convergence in Proximal Point Algorithms with Bregman Functions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 155 Osman Guier 1. Introduction . . . : . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 155 2. Convergence for Function Minimization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 158 3. Convergence for Arbitrary Maximal Monotone Operators . . . . . . . . . . . . . . . . . 161 References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 163 Adding and Deleting Constraints in the Logarithmic Barrier Method for LP . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 166 D. den Hertog, C. Roos, and T. Terlaky 1. Introduction . . . . . . .
EUR 178,14
Convertire valutaQuantità: Più di 20 disponibili
Aggiungi al carrelloGebunden. Condizione: New. Preface. Scheduling Multiprocessor Flow Shops Bo Chen. The k-Walk Polyhedron C.R. Coullard, A.B. Gamble, Jin Liu. Two Geometric Optimization Problems B. Dasgupta, V. Roychowdhury. A Scaled Gradient Projection Algorithm for Linear Complementarit.
Editore: Society for Industrial and Appli, 1987
ISBN 10: 0898715369 ISBN 13: 9780898715361
Lingua: Inglese
Da: HPB-Red, Dallas, TX, U.S.A.
EUR 104,56
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrellohardcover. Condizione: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority!
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
EUR 160,91
Convertire valutaQuantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
EUR 161,32
Convertire valutaQuantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
EUR 230,22
Convertire valutaQuantità: 4 disponibili
Aggiungi al carrelloCondizione: New. pp. 408.
EUR 238,58
Convertire valutaQuantità: 2 disponibili
Aggiungi al carrelloPaperback. Condizione: Brand New. 390 pages. 9.45x6.30x0.92 inches. In Stock.
Da: dsmbooks, Liverpool, Regno Unito
EUR 226,44
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: Like New. Like New. book.
EUR 247,94
Convertire valutaQuantità: 2 disponibili
Aggiungi al carrelloBuch. Condizione: Neu. Neuware - 2. The Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 59 3. Convergence Analysis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . , . . . . 60 4. Complexity Analysis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 63 5. Conclusions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 67 References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 67 A Simple Proof for a Result of Ollerenshaw on Steiner Trees . . . . . . . . . . 68 Xiufeng Du, Ding-Zhu Du, Biao Gao, and Lixue Qii 1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 68 2. In the Euclidean Plane . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 69 3. In the Rectilinear Plane . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 70 4. Discussion . . . . . . . . . . . . -. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 71 References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 71 Optimization Algorithms for the Satisfiability (SAT) Problem . . . . . . . . . 72 Jun Gu 1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 72 2. A Classification of SAT Algorithms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7:3 3. Preliminaries . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . IV 4. Complete Algorithms and Incomplete Algorithms . . . . . . . . . . . . . . . . . . . . . . . . . . 81 5. Optimization: An Iterative Refinement Process . . . . . . . . . . . . . . . . . . . . . . . . . . . . 86 6. Local Search Algorithms for SAT . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 89 7. Global Optimization Algorithms for SAT Problem . . . . . . . . . . . . . . . . . . . . . . . . 106 8. Applications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 137 9. Future Work . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 140 10. Conclusions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 141 References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 143 Ergodic Convergence in Proximal Point Algorithms with Bregman Functions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 155 Osman Guier 1. Introduction . . . : . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 155 2. Convergence for Function Minimization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 158 3. Convergence for Arbitrary Maximal Monotone Operators . . . . . . . . . . . . . . . . . 161 References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 163 Adding and Deleting Constraints in the Logarithmic Barrier Method for LP . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 166 D. den Hertog, C. Roos, and T. Terlaky 1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . .
Da: moluna, Greven, Germania
EUR 136,16
Convertire valutaQuantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Preface. Scheduling Multiprocessor Flow Shops Bo Chen. The k-Walk Polyhedron C.R. Coullard, A.B. Gamble, Jin Liu. Two Geometric Optimization Problems B. Dasgupta, V. Roychowdhury. A Scaled Gradient Projection Algorithm for Linear Complementarit.
Da: Majestic Books, Hounslow, Regno Unito
EUR 158,21
Convertire valutaQuantità: 4 disponibili
Aggiungi al carrelloCondizione: New. Print on Demand.
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
EUR 160,49
Convertire valutaQuantità: 2 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -2. The Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 59 3. Convergence Analysis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . , . . . . 60 4. Complexity Analysis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 63 5. Conclusions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 67 References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 67 A Simple Proof for a Result of Ollerenshaw on Steiner Trees . . . . . . . . . . 68 Xiufeng Du, Ding-Zhu Du, Biao Gao, and Lixue Qii 1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 68 2. In the Euclidean Plane . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 69 3. In the Rectilinear Plane . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 70 4. Discussion . . . . . . . . . . . . -. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 71 References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 71 Optimization Algorithms for the Satisfiability (SAT) Problem . . . . . . . . . 72 Jun Gu 1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 72 2. A Classification of SAT Algorithms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7:3 3. Preliminaries . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . IV 4. Complete Algorithms and Incomplete Algorithms . . . . . . . . . . . . . . . . . . . . . . . . . . 81 5. Optimization: An Iterative Refinement Process . . . . . . . . . . . . . . . . . . . . . . . . . . . . 86 6. Local Search Algorithms for SAT . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 89 7. Global Optimization Algorithms for SAT Problem . . . . . . . . . . . . . . . . . . . . . . . . 106 8. Applications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 137 9. Future Work . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 140 10. Conclusions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 141 References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 143 Ergodic Convergence in Proximal Point Algorithms with Bregman Functions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 155 Osman Guier 1. Introduction . . . : . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 155 2. Convergence for Function Minimization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 158 3. Convergence for Arbitrary Maximal Monotone Operators . . . . . . . . . . . . . . . . . 161 References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 163 Adding and Deleting Constraints in the Logarithmic Barrier Method for LP . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 166 D. den Hertog, C. Roos, and T. Terlaky 1. Introducti.
Da: Biblios, Frankfurt am main, HESSE, Germania
EUR 163,31
Convertire valutaQuantità: 4 disponibili
Aggiungi al carrelloCondizione: New. PRINT ON DEMAND.
Editore: Springer US, Springer New York Okt 2011, 2011
ISBN 10: 1461336317 ISBN 13: 9781461336310
Lingua: Inglese
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
EUR 160,49
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -of SAT Algorithms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7:3 3. Preliminaries . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . IV 4. Complete Algorithms and Incomplete Algorithms . . . . . . . . . . . . . . . . . . . . . . . . . . 81 5. Optimization: An Iterative Refinement Process . . . . . . . . . . . . . . . . . . . . . . . . . . . . 86 6. Local Search Algorithms for SAT . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 89 7. Global Optimization Algorithms for SAT Problem . . . . . . . . . . . . . . . . . . . . . . . . 106 8. Applications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 137 9. Future Work . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 140 10. Conclusions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 141 References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 143 Ergodic Convergence in Proximal Point Algorithms with Bregman Functions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 155 Osman Guier 1. Introduction . . . : . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 155 2. Convergence for Function Minimization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 158 3. Convergence for Arbitrary Maximal Monotone Operators . . . . . . . . . . . . . . . . . 161 References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 163 Adding and Deleting Constraints in the LogarithmicSpringer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 408 pp. Englisch.
Da: Majestic Books, Hounslow, Regno Unito
EUR 237,28
Convertire valutaQuantità: 4 disponibili
Aggiungi al carrelloCondizione: New. Print on Demand pp. 408 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam.
Da: Biblios, Frankfurt am main, HESSE, Germania
EUR 243,39
Convertire valutaQuantità: 4 disponibili
Aggiungi al carrelloCondizione: New. PRINT ON DEMAND pp. 408.