Published by Forgotten Books, 2024
ISBN 10: 1332986781 ISBN 13: 9781332986781
Seller: Forgotten Books, London, United Kingdom
Paperback. Condition: 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. Forgotten Books publishes hundreds of thousands of rare and classic books. This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works. The digital edition of all books may be viewed on our website before purchase. print-on-demand item.
Published by Forgotten Books, 2018
ISBN 10: 1332986781 ISBN 13: 9781332986781
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.
Published by Forgotten Books, 2018
ISBN 10: 1332986781 ISBN 13: 9781332986781
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.
Published by Palala Press, 2018
ISBN 10: 1378159446 ISBN 13: 9781378159446
Seller: booksXpress, Bayonne, NJ, U.S.A.
Soft Cover. Condition: new.
Published by Springer Verlag, New York, 2001
ISBN 10: 3540424709 ISBN 13: 9783540424703
Seller: Doss-Haus Books, Redondo Beach, CA, U.S.A.
Hardcover. Condition: 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].
Published by Berlin Springer Verlag, 2001
ISBN 10: 3540424709 ISBN 13: 9783540424703
Seller: CSG Onlinebuch GMBH, Darmstadt, Germany
Softcover. Condition: Gebraucht. 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 Englisch.
Published by Springer, 2001
ISBN 10: 3540424709 ISBN 13: 9783540424703
Seller: GF Books, Inc., Hawthorne, CA, U.S.A.
Condition: Very Good. Book is in Used-VeryGood condition. Pages and cover are clean and intact. Used items may not include supplementary materials such as CDs or access codes. May show signs of minor shelf wear and contain very limited notes and highlighting. 1.1.
Published by Berlin, Springer., 2001
ISBN 10: 3540424709 ISBN 13: 9783540424703
Seller: Universitätsbuchhandlung Herta Hold GmbH, Berlin, Germany
IX, 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.
Published by Springer, 2001
ISBN 10: 3540424709 ISBN 13: 9783540424703
Seller: booksXpress, Bayonne, NJ, U.S.A.
Soft Cover. Condition: new.
Published by Springer, 2013
ISBN 10: 3642366937 ISBN 13: 9783642366932
Seller: booksXpress, Bayonne, NJ, U.S.A.
Soft Cover. Condition: new.
Published by Springer, 2001
ISBN 10: 3540424709 ISBN 13: 9783540424703
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Condition: New.
Published by Springer, 2013
ISBN 10: 3642366937 ISBN 13: 9783642366932
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Condition: New.
Published by Springer, 2001
ISBN 10: 3540424709 ISBN 13: 9783540424703
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New.
Published by Springer, 2013
ISBN 10: 3642366937 ISBN 13: 9783642366932
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New.
Published by Springer, 2014
ISBN 10: 3662187191 ISBN 13: 9783662187197
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Condition: New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book.
Published by Springer, 2014
ISBN 10: 3662187191 ISBN 13: 9783662187197
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Condition: New. In.
Published by Springer, 2001
ISBN 10: 3540424709 ISBN 13: 9783540424703
Seller: Book Deals, Tucson, AZ, U.S.A.
Condition: Good. Good condition. This is the average used book, that has all pages or leaves present, but may include writing. Book may be ex-library with stamps and stickers. 1.1.
Published by Springer, 2001
ISBN 10: 3540424709 ISBN 13: 9783540424703
Seller: California Books, Miami, FL, U.S.A.
Condition: New.
Published by Springer, 2013
ISBN 10: 3642366937 ISBN 13: 9783642366932
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Condition: New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book.
Published by Springer, 2001
ISBN 10: 3540424709 ISBN 13: 9783540424703
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Condition: New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book.
Published by Springer, 2013
ISBN 10: 3642366937 ISBN 13: 9783642366932
Seller: Books Puddle, New York, NY, U.S.A.
Condition: New. pp. 414.
Published by Springer, 2001
ISBN 10: 3540424709 ISBN 13: 9783540424703
Seller: GreatBookPricesUK, Castle Donington, DERBY, United Kingdom
Condition: New.
Published by Springer, 2013
ISBN 10: 3642366937 ISBN 13: 9783642366932
Seller: GreatBookPricesUK, Castle Donington, DERBY, United Kingdom
Condition: New.
Published by Springer Berlin Heidelberg Aug 2001, 2001
ISBN 10: 3540424709 ISBN 13: 9783540424703
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - 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. 320 pp. Englisch.
Published by Springer Berlin Heidelberg Feb 2013, 2013
ISBN 10: 3642366937 ISBN 13: 9783642366932
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 412 pp. Englisch.
Published by Springer Berlin Heidelberg, 2013
ISBN 10: 3642366937 ISBN 13: 9783642366932
Seller: Buchpark, Trebbin, Germany
Condition: Sehr gut. Zustand: Sehr gut | Seiten: 412 | Sprache: Englisch | Produktart: Bücher.
Published by Springer, 2013
ISBN 10: 3642366937 ISBN 13: 9783642366932
Seller: Majestic Books, Hounslow, United Kingdom
Condition: New. Print on Demand pp. 414 32 Illus.
Published by Springer 2013-02, 2013
ISBN 10: 3642366937 ISBN 13: 9783642366932
Seller: Chiron Media, Wallingford, United Kingdom
PF. Condition: New.
Published by Springer Berlin Heidelberg, 2013
ISBN 10: 3642366937 ISBN 13: 9783642366932
Seller: AHA-BUCH GmbH, Einbeck, Germany
Taschenbuch. Condition: 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.
Published by Springer Berlin Heidelberg, 2001
ISBN 10: 3540424709 ISBN 13: 9783540424703
Seller: AHA-BUCH GmbH, Einbeck, Germany
Taschenbuch. Condition: 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.