0
Your cart

Your cart is empty

Books > Business & Economics > Economics > Economic theory & philosophy

Buy Now

Geometric Algorithms and Combinatorial Optimization (Paperback, 2nd ed. 1993. Softcover reprint of the original 2nd ed. 1993) Loot Price: R3,820
Discovery Miles 38 200
Geometric Algorithms and Combinatorial Optimization (Paperback, 2nd ed. 1993. Softcover reprint of the original 2nd ed. 1993):...

Geometric Algorithms and Combinatorial Optimization (Paperback, 2nd ed. 1993. Softcover reprint of the original 2nd ed. 1993)

Martin Groetschel, Laszlo Lovasz, Alexander Schrijver

Series: Algorithms and Combinatorics, 2

 (sign in to rate)
Loot Price R3,820 Discovery Miles 38 200 | Repayment Terms: R358 pm x 12*

Bookmark and Share

Expected to ship within 18 - 22 working days

Since the publication of the first edition of our book, geometric algorithms and combinatorial optimization have kept growing at the same fast pace as before. Nevertheless, we do not feel that the ongoing research has made this book outdated. Rather, it seems that many of the new results build on the models, algorithms, and theorems presented here. For instance, the celebrated Dyer-Frieze-Kannan algorithm for approximating the volume of a convex body is based on the oracle model of convex bodies and uses the ellipsoid method as a preprocessing technique. The polynomial time equivalence of optimization, separation, and membership has become a commonly employed tool in the study of the complexity of combinatorial optimization problems and in the newly developing field of computational convexity. Implementations of the basis reduction algorithm can be found in various computer algebra software systems. On the other hand, several of the open problems discussed in the first edition are still unsolved. For example, there are still no combinatorial polynomial time algorithms known for minimizing a submodular function or finding a maximum clique in a perfect graph. Moreover, despite the success of the interior point methods for the solution of explicitly given linear programs there is still no method known that solves implicitly given linear programs, such as those described in this book, and that is both practically and theoretically efficient. In particular, it is not known how to adapt interior point methods to such linear programs.

General

Imprint: Springer-Verlag
Country of origin: Germany
Series: Algorithms and Combinatorics, 2
Release date: December 2011
First published: 1993
Authors: Martin Groetschel • Laszlo Lovasz • Alexander Schrijver
Dimensions: 242 x 170 x 20mm (L x W x T)
Format: Paperback
Pages: 362
Edition: 2nd ed. 1993. Softcover reprint of the original 2nd ed. 1993
ISBN-13: 978-3-642-78242-8
Categories: Books > Business & Economics > Economics > Economic theory & philosophy
Books > Science & Mathematics > Mathematics > Combinatorics & graph theory
Books > Reference & Interdisciplinary > Communication studies > Information theory > Cybernetics & systems theory
Books > Science & Mathematics > Mathematics > Calculus & mathematical analysis > Calculus of variations
Promotions
LSN: 3-642-78242-6
Barcode: 9783642782428

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Partners