Geometric Algorithms and Combinatorial Optimization

Gr�tschel, Martin; Lovasz, Laszlo; Schrijver, Alexander

ISBN 10: 3642782426 ISBN 13: 9783642782428

Edit� par Springer, 2011

Neuf(s) Couverture souple

Vendeur Best Price, Torrance, CA, Etats-Unis �valuation du vendeur 5 sur 5 �toiles

Vendeur AbeBooks depuis 30 ao�t 2024

Cet article sp�cifique n'est plus disponible.

Afficher tous les articles du vendeur Cr�er une demande de livres portant sur des articles similaires

Afficher tous les exemplaires de ce livre

A propos de cet article

SUPER FAST SHIPPING. N� de r�f. du vendeur 9783642782428

Signaler cet article

Synopsis :

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).

Pr�sentation de l'�diteur: This book develops geometric techniques for proving the polynomial time solvability of problems in convexity theory, geometry, and, in particular, combinatorial optimization. It offers a unifying approach which is based on two fundamental geometric algorithms: the ellipsoid method for finding a point in a convex set and the basis reduction method for point lattices. This 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. The first edition of this book was received enthusiastically by the community of discrete mathematicians, combinatorial optimizers, operations researchers, and computer scientists. To quote just from a few reviews: "The book is written in a very grasping way, legible both for people who are interested in the most important results and for people who are interested in technical details and proofs." #manuscripta geodaetica#1

Les informations fournies dans la section � A propos du livre � peuvent faire r�f�rence � une autre �dition de ce titre.

D�tails bibliographiques

Titre : Geometric Algorithms and Combinatorial ...
�diteur : Springer
Date d'�dition : 2011
Reliure : Couverture souple
Etat : New
Edition : 2�me �dition

Meilleurs r�sultats de recherche sur AbeBooks

Image fournie par le vendeur

Geometric Algorithms and Combinatorial Optimization

Martin Gr�tschel|Laszlo Lovasz|Alexander Schrijver

Edit� par Springer Berlin Heidelberg, 2011

ISBN 10 : 3642782426 ISBN 13 : 9783642782428

Neuf Couverture souple

impression � la demande

Vendeur : moluna, Greven, Allemagne

�valuation du vendeur 4 sur 5 �toiles

Etat : 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. N� de r�f. du vendeur 5070508

Contacter le vendeur

Acheter neuf

EUR 127,40

Frais de port : EUR 48,99

De Allemagne vers Etats-Unis

Quantit� disponible : Plus de 20 disponibles

Ajouter au panier

Image fournie par le vendeur

Autres images

Geometric Algorithms and Combinatorial Optimization

Martin Gr�tschel (u. a.)

Edit� par Springer, 2011

ISBN 10 : 3642782426 ISBN 13 : 9783642782428

Neuf Taschenbuch

Vendeur : preigu, Osnabr�ck, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Contacter le vendeur

Acheter neuf

EUR 132,20

Frais de port : EUR 70

De Allemagne vers Etats-Unis

Quantit� disponible : 5 disponible(s)

Ajouter au panier

Image d'archives

Geometric Algorithms and Combinatorial Optimization

Gr�tschel, Martin; Lovasz, Laszlo; Schrijver, Alexander

Edit� par Springer, 2011

ISBN 10 : 3642782426 ISBN 13 : 9783642782428

Neuf Couverture souple

Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni

�valuation du vendeur 5 sur 5 �toiles

Etat : New. In. N� de r�f. du vendeur ria9783642782428_new

Contacter le vendeur

Acheter neuf

EUR 138,46

Frais de port : EUR 13,60

De Royaume-Uni vers Etats-Unis

Quantit� disponible : Plus de 20 disponibles

Ajouter au panier

Image fournie par le vendeur

Geometric Algorithms and Combinatorial Optimization

Martin Gr�tschel

Edit� par Springer Berlin Heidelberg, Springer Berlin Heidelberg Dez 2011, 2011

ISBN 10 : 3642782426 ISBN 13 : 9783642782428

Neuf Taschenbuch Edition originale

Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Taschenbuch. Etat : Neu. 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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 380 pp. Englisch. N� de r�f. du vendeur 9783642782428

Contacter le vendeur

Acheter neuf

EUR 149,79

Frais de port : EUR 60

De Allemagne vers Etats-Unis

Quantit� disponible : 2 disponible(s)

Ajouter au panier

Image fournie par le vendeur

Geometric Algorithms and Combinatorial Optimization

Martin Gr�tschel

Edit� par Springer Berlin Heidelberg Dez 2011, 2011

ISBN 10 : 3642782426 ISBN 13 : 9783642782428

Neuf Taschenbuch

impression � la demande

Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Taschenbuch. Etat : 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. N� de r�f. du vendeur 9783642782428

Contacter le vendeur

Acheter neuf

EUR 149,79

Frais de port : EUR 23

De Allemagne vers Etats-Unis

Quantit� disponible : 2 disponible(s)

Ajouter au panier

Image fournie par le vendeur

Geometric Algorithms and Combinatorial Optimization

Martin Gr�tschel

Edit� par Springer Berlin Heidelberg, 2011

ISBN 10 : 3642782426 ISBN 13 : 9783642782428

Neuf Taschenbuch

Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. N� de r�f. du vendeur 9783642782428

Contacter le vendeur