PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.
Da: Doss-Haus Books, Redondo Beach, CA, U.S.A.
Hardcover. Condizione: Very Good. No Jacket. Hardcover 2001 library bound edition. Ex-library book with stamps and labels attached. Binding firm. Pages unmarked and clean. Laminated covers and text in very good condition. Series: Lecture Notes in Computer Science ;2129. 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001, Berkeley, CA, USA, August 18-20, 2001 Proceedings. [ix, 296 p. : ill. ; 24 cm].
Da: PBShop.store UK, Fairford, GLOS, Regno Unito
EUR 20,25
Quantità: 15 disponibili
Aggiungi al carrelloPAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.
Lingua: Inglese
Editore: Springer Berlin / Heidelberg, 2001
ISBN 10: 3540424709 ISBN 13: 9783540424703
Da: Better World Books, Mishawaka, IN, U.S.A.
Condizione: Good. Former library copy. Pages intact with minimal writing/highlighting. The binding may be loose and creased. Dust jackets/supplements are not included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.
Da: Universitätsbuchhandlung Herta Hold GmbH, Berlin, Germania
EUR 10,00
Quantità: 1 disponibili
Aggiungi al carrelloIX, 296 p. Softcover. Versand aus Deutschland / We dispatch from Germany via Air Mail. Einband bestoßen, daher Mängelexemplar gestempelt, sonst sehr guter Zustand. Imperfect copy due to slightly bumped cover, apart from this in very good condition. Stamped. Lecture Notes in Computer Science, Vol. 2129. Sprache: Englisch.
Da: GreatBookPrices, Columbia, MD, U.S.A.
EUR 53,57
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: GreatBookPrices, Columbia, MD, U.S.A.
EUR 61,53
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Da: Forgotten Books, London, Regno Unito
EUR 15,21
Quantità: Più di 20 disponibili
Aggiungi al carrelloPaperback. Condizione: New. Print on Demand. This book delves into the probabilistic analysis of the Held-Karp lower bound, a key concept for solving the Euclidean Traveling Salesman Problem (ETSP). The ETSP is a classic combinatorial optimization problem that finds applications in various fields, such as logistics and circuit board designing. The Held-Karp lower bound provides a crucial estimate for the length of the optimal tour in the ETSP. The author takes a novel approach by combining the combinatorial interpretation of the lower bound with the theory of subadditive Euclidean functionals. This enables a probabilistic analysis of the bound, leading to new insights into its behavior. The book establishes that the Held-Karp lower bound is asymptotically close to a constant times the optimal tour length when the number of points in the ETSP tends to infinity. This result provides a theoretical explanation for the practical observation that the lower bound often closely approximates the optimal solution. The analysis also establishes the complete convergence of the Held-Karp lower bound, a significant theoretical result that further strengthens the understanding of its behavior. Overall, this book offers a rigorous and innovative examination of the Held-Karp lower bound, contributing to the understanding of both the ETSP and probabilistic analysis in combinatorial optimization. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item.
Da: GreatBookPrices, Columbia, MD, U.S.A.
EUR 63,34
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: California Books, Miami, FL, U.S.A.
EUR 65,70
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Lingua: Inglese
Editore: Springer-Verlag Berlin and Heidelberg GmbH and Co. KG, DE, 2001
ISBN 10: 3540424709 ISBN 13: 9783540424703
Da: Rarewaves.com USA, London, LONDO, Regno Unito
EUR 66,35
Quantità: Più di 20 disponibili
Aggiungi al carrelloPaperback. Condizione: New. 2001 ed.
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 52,81
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 58,37
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 58,37
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
Da: Chiron Media, Wallingford, Regno Unito
EUR 56,54
Quantità: 10 disponibili
Aggiungi al carrelloPF. Condizione: New.
Da: Chiron Media, Wallingford, Regno Unito
EUR 56,67
Quantità: 10 disponibili
Aggiungi al carrelloPaperback. Condizione: New.
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 58,36
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 58,36
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 66,20
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Da: CSG Onlinebuch GMBH, Darmstadt, Germania
EUR 14,88
Quantità: 1 disponibili
Aggiungi al carrelloSoftcover. Condizione: Sehr gut. Gebraucht - Sehr gut Zustand: Sehr gut, Mängelexemplar, IX, 297 pp. About this book This book constitutes the joint refereed proceedings of the 4th International Workshop on Approximation Algorithms for Optimization Problems, APPROX 2001 and of the 5th International Workshop on Ranomization and Approximation Techniques in Computer Science, RANDOM 2001, held in Berkeley, California, USA in August 2001. The 26 revised full papers presented were carefully reviewed and selected from a total of 54 submissions. Among the issues addressed are design and analysis of approximation algorithms, inapproximability results, on-line problems, randomization, de-randomization, average-case analysis, approximation classes, randomized complexity theory, scheduling, routing, coloring, partitioning, packing, covering, computational geometry, network design, and applications in various fields. Written for researchers and professionals.
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 53,49
Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book constitutes the joint refereed proceedings of the 4th International Workshop on Approximation Algorithms for Optimization Problems, APPROX 2001 and of the 5th International Workshop on Ranomization and Approximation Techniques in Computer Science, RANDOM 2001, held in Berkeley, California, USA in August 2001. The 26 revised full papers presented were carefully reviewed and selected from a total of 54 submissions. Among the issues addressed are design and analysis of approximation algorithms, inapproximability results, on-line problems, randomization, de-randomization, average-case analysis, approximation classes, randomized complexity theory, scheduling, routing, coloring, partitioning, packing, covering, computational geometry, network design, and applications in various fields.
Lingua: Inglese
Editore: Springer Berlin Heidelberg, Springer Berlin Heidelberg Aug 2001, 2001
ISBN 10: 3540424709 ISBN 13: 9783540424703
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
EUR 53,49
Quantità: 2 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Neuware -This book constitutes the joint refereed proceedings of the 4th International Workshop on Approximation Algorithms for Optimization Problems, APPROX 2001 and of the 5th International Workshop on Ranomization and Approximation Techniques in Computer Science, RANDOM 2001, held in Berkeley, California, USA in August 2001. The 26 revised full papers presented were carefully reviewed and selected from a total of 54 submissions. Among the issues addressed are design and analysis of approximation algorithms, inapproximability results, on-line problems, randomization, de-randomization, average-case analysis, approximation classes, randomized complexity theory, scheduling, routing, coloring, partitioning, packing, covering, computational geometry, network design, and applications in various fields.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 320 pp. Englisch.
Lingua: Inglese
Editore: Springer Berlin Heidelberg, 2013
ISBN 10: 3642366937 ISBN 13: 9783642366932
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 53,49
Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book constitutes the proceedings of the 16th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2013, held in Valparaíso, Chile, in March 2013. The 33 full papers presented were carefully reviewed and selected from 98 submissions. The conference is a forum for researchers and practitioners working on various aspects of integer programming and combinatorial optimization with the aim to present recent developments in theory, computation, and applications. The scope of IPCO is viewed in a broad sense, to include algorithmic and structural results in integer programming and combinatorial optimization as well as revealing computational studies and novel applications of discrete optimization to practical problems.
Da: preigu, Osnabrück, Germania
EUR 50,25
Quantità: 5 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques | 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001 Berkeley, CA,USA, Augu | Michel Goemans (u. a.) | Taschenbuch | ix | Englisch | 2001 | Springer | EAN 9783540424703 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
Da: preigu, Osnabrück, Germania
EUR 50,25
Quantità: 5 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Integer Programming and Combinatorial Optimization | 16th International Conference, IPCO 2013, Valparaíso, Chile, March 18-20, 2013. Proceedings | Michel Goemans (u. a.) | Taschenbuch | xii | Englisch | 2013 | Springer | EAN 9783642366932 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 108,91
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Da: Mispah books, Redhill, SURRE, Regno Unito
EUR 99,45
Quantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
Da: GreatBookPrices, Columbia, MD, U.S.A.
EUR 129,68
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Lingua: Inglese
Editore: Springer-Verlag Berlin and Heidelberg GmbH and Co. KG, DE, 2001
ISBN 10: 3540424709 ISBN 13: 9783540424703
Da: Rarewaves.com UK, London, Regno Unito
EUR 61,05
Quantità: Più di 20 disponibili
Aggiungi al carrelloPaperback. Condizione: New. 2001 ed.
Da: Buchpark, Trebbin, Germania
EUR 33,29
Quantità: 1 disponibili
Aggiungi al carrelloCondizione: Sehr gut. Zustand: Sehr gut | Seiten: 412 | Sprache: Englisch | Produktart: Bücher | This book constitutes the proceedings of the 16th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2013, held in Valparaíso, Chile, in March 2013. The 33 full papers presented were carefully reviewed and selected from 98 submissions. The conference is a forum for researchers and practitioners working on various aspects of integer programming and combinatorial optimization with the aim to present recent developments in theory, computation, and applications. The scope of IPCO is viewed in a broad sense, to include algorithmic and structural results in integer programming and combinatorial optimization as well as revealing computational studies and novel applications of discrete optimization to practical problems.