Geometric algorithms combinatorial optimization di grotschel martin (15 risultati)

Condizione: Fine. First edition, first printing, 374 pp., hardcover, fine. - If you are reading this, this item is actually (physically) in our stock and ready for shipment once ordered. We are not bookjackers. Buyer is responsible for any additional duties, taxes, or fees required by recipient's country.…

gebundene Ausgabe. Condizione: Gut. 2. Auflage.. 362 Seiten Das hier angebotene Buch stammt aus einer teilaufgelösten Bibliothek und kann die entsprechenden Kennzeichnungen aufweisen (Rückenschild, Instituts-Stempel.); der Buchzustand ist ansonsten ordentlich und dem Alter entsprechend gut. Einband folienkaschiert. In ENGLISCHER Sprache. Sprache: Englisch Gewicht in Gramm: 750.…

Condizione: New. In English.

Condizione: New.

Hardcover. Condizione: Good. X_Library copy with light corner wear. I found no text marks. Good clean used book.

Paperback. Condizione: Brand New. 2nd edition. 374 pages. 9.61x0.87x6.69 inches. In Stock.

Paperback. Condizione: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Condizione: As New. Unread book in perfect condition.

Condizione: gut. 1993. Geometric Algorithms and Combinatorial Optimization Algorithms and Combinatorics, 2 In deutscher Sprache. pages.

hardcover. Condizione: Good. Good. Dust Jacket NOT present. CD WILL BE MISSING. . SHIPS FROM MULTIPLE LOCATIONS. book.

Springer-Verlag, Berlin - Heidelberg - New York - London - Paris - Tokyo, 1988. Gelber leinengeprägter Original-Pappband, XII, 362 Seiten, Lex.8° (25 cm). Text in ENGLISCHER Sprache. Einband mit minimalen Gebrauchsspuren, Name im vorderen Innendeckel, Papier ohne Bräunungsspuren, Buchblock sauber (also ohne Unterstreichungen & Randglossen). Sehr schönes Exemplar. Zustand: sehr gut.…

Condizione: new. Questo è un articolo print on demand.

Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 380 pp. Englisch.…

Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 see.…

Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -This book develops geometric techniques for proving the polynomial time solvability of problems in convexity theory, geometry, and, in particular, combinatorial optimization. The book is a continuation and extension of previous research of the authors for which they received the Fulkerson prize, awarded by the Mathematical Programming Society and the American Mathematical Society. To quote from a review: 'This book . is doubtless one of the outstanding books in discrete mathematics at all.' (Journal of Information Proceedings and Cybernetics).Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 380 pp. Englisch.…