Verwandte Artikel zu Geometric Algorithms and Combinatorial Optimization:...

Geometric Algorithms and Combinatorial Optimization: Corrected Edition: 2 (Algorithms and Combinatorics) - Softcover

 
9783642782428: Geometric Algorithms and Combinatorial Optimization: Corrected Edition: 2 (Algorithms and Combinatorics)

Inhaltsangabe

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

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.

Reseña del editor

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.

Reseña del editor

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

„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.

Gebraucht kaufen

Zustand: Wie neu
Like New
Diesen Artikel anzeigen

EUR 28,71 für den Versand von Vereinigtes Königreich nach USA

Versandziele, Kosten & Dauer

EUR 3,45 für den Versand innerhalb von/der USA

Versandziele, Kosten & Dauer

Suchergebnisse für Geometric Algorithms and Combinatorial Optimization:...

Beispielbild für diese ISBN

Grötschel, Martin; Lovasz, Laszlo; Schrijver, Alexander
Verlag: Springer, 2011
ISBN 10: 3642782426 ISBN 13: 9783642782428
Neu Softcover

Anbieter: Lucky's Textbooks, Dallas, TX, USA

Verkäuferbewertung 5 von 5 Sternen 5 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

Zustand: New. Bestandsnummer des Verkäufers ABLIING23Mar3113020236265

Verkäufer kontaktieren

Neu kaufen

EUR 150,00
Währung umrechnen
Versand: EUR 3,45
Innerhalb der USA
Versandziele, Kosten & Dauer

Anzahl: Mehr als 20 verfügbar

In den Warenkorb

Beispielbild für diese ISBN

Grötschel, Martin; Lovasz, Laszlo; Schrijver, Alexander
Verlag: Springer, 2011
ISBN 10: 3642782426 ISBN 13: 9783642782428
Neu Softcover

Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich

Verkäuferbewertung 5 von 5 Sternen 5 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

Zustand: New. In. Bestandsnummer des Verkäufers ria9783642782428_new

Verkäufer kontaktieren

Neu kaufen

EUR 140,09
Währung umrechnen
Versand: EUR 13,76
Von Vereinigtes Königreich nach USA
Versandziele, Kosten & Dauer

Anzahl: Mehr als 20 verfügbar

In den Warenkorb

Foto des Verkäufers

Martin Grötschel
ISBN 10: 3642782426 ISBN 13: 9783642782428
Neu Taschenbuch
Print-on-Demand

Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Deutschland

Verkäuferbewertung 5 von 5 Sternen 5 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

Taschenbuch. Zustand: 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. Bestandsnummer des Verkäufers 9783642782428

Verkäufer kontaktieren

Neu kaufen

EUR 149,79
Währung umrechnen
Versand: EUR 23,00
Von Deutschland nach USA
Versandziele, Kosten & Dauer

Anzahl: 2 verfügbar

In den Warenkorb

Foto des Verkäufers

Martin Grötschel|Laszlo Lovasz|Alexander Schrijver
ISBN 10: 3642782426 ISBN 13: 9783642782428
Neu Softcover
Print-on-Demand

Anbieter: moluna, Greven, Deutschland

Verkäuferbewertung 5 von 5 Sternen 5 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

Zustand: 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. Bestandsnummer des Verkäufers 5070508

Verkäufer kontaktieren

Neu kaufen

EUR 127,40
Währung umrechnen
Versand: EUR 48,99
Von Deutschland nach USA
Versandziele, Kosten & Dauer

Anzahl: Mehr als 20 verfügbar

In den Warenkorb

Foto des Verkäufers

Martin Grötschel
ISBN 10: 3642782426 ISBN 13: 9783642782428
Neu Taschenbuch

Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland

Verkäuferbewertung 5 von 5 Sternen 5 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

Taschenbuch. Zustand: 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. Bestandsnummer des Verkäufers 9783642782428

Verkäufer kontaktieren

Neu kaufen

EUR 149,79
Währung umrechnen
Versand: EUR 31,24
Von Deutschland nach USA
Versandziele, Kosten & Dauer

Anzahl: 1 verfügbar

In den Warenkorb

Foto des Verkäufers

Martin Grötschel, Laszlo Lovasz, Alexander Schrijver
ISBN 10: 3642782426 ISBN 13: 9783642782428
Neu Paperback

Anbieter: Rarewaves.com USA, London, LONDO, Vereinigtes Königreich

Verkäuferbewertung 5 von 5 Sternen 5 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

Paperback. Zustand: New. 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. 2nd ed. 1993. Softcover reprint of the original 2nd ed. 1993. Bestandsnummer des Verkäufers LU-9783642782428

Verkäufer kontaktieren

Neu kaufen

EUR 200,61
Währung umrechnen
Versand: Gratis
Von Vereinigtes Königreich nach USA
Versandziele, Kosten & Dauer

Anzahl: Mehr als 20 verfügbar

In den Warenkorb

Foto des Verkäufers

Martin Grötschel
ISBN 10: 3642782426 ISBN 13: 9783642782428
Neu Taschenbuch Erstausgabe

Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland

Verkäuferbewertung 5 von 5 Sternen 5 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

Taschenbuch. Zustand: 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. Bestandsnummer des Verkäufers 9783642782428

Verkäufer kontaktieren

Neu kaufen

EUR 149,79
Währung umrechnen
Versand: EUR 55,00
Von Deutschland nach USA
Versandziele, Kosten & Dauer

Anzahl: 2 verfügbar

In den Warenkorb

Beispielbild für diese ISBN

Alexander Schrijver Laszlo Lovasz Martin Gr?tschel
Verlag: Springer, 2011
ISBN 10: 3642782426 ISBN 13: 9783642782428
Neu Softcover

Anbieter: Books Puddle, New York, NY, USA

Verkäuferbewertung 4 von 5 Sternen 4 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

Zustand: New. pp. xii + 362 2nd Edition. Bestandsnummer des Verkäufers 2654507731

Verkäufer kontaktieren

Neu kaufen

EUR 205,70
Währung umrechnen
Versand: EUR 3,45
Innerhalb der USA
Versandziele, Kosten & Dauer

Anzahl: 4 verfügbar

In den Warenkorb

Beispielbild für diese ISBN

Schrijver Alexander Lovasz Laszlo Gr?tschel Martin
Verlag: Springer, 2011
ISBN 10: 3642782426 ISBN 13: 9783642782428
Neu Softcover
Print-on-Demand

Anbieter: Majestic Books, Hounslow, Vereinigtes Königreich

Verkäuferbewertung 5 von 5 Sternen 5 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

Zustand: New. Print on Demand pp. xii + 362 23 Figures. Bestandsnummer des Verkäufers 55052044

Verkäufer kontaktieren

Neu kaufen

EUR 217,41
Währung umrechnen
Versand: EUR 7,47
Von Vereinigtes Königreich nach USA
Versandziele, Kosten & Dauer

Anzahl: 4 verfügbar

In den Warenkorb

Beispielbild für diese ISBN

Schrijver Alexander Lovasz Laszlo Gr?tschel Martin
Verlag: Springer, 2011
ISBN 10: 3642782426 ISBN 13: 9783642782428
Neu Softcover
Print-on-Demand

Anbieter: Biblios, Frankfurt am main, HESSE, Deutschland

Verkäuferbewertung 5 von 5 Sternen 5 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

Zustand: New. PRINT ON DEMAND pp. xii + 362. Bestandsnummer des Verkäufers 1854507737

Verkäufer kontaktieren

Neu kaufen

EUR 219,84
Währung umrechnen
Versand: EUR 9,95
Von Deutschland nach USA
Versandziele, Kosten & Dauer

Anzahl: 4 verfügbar

In den Warenkorb

Es gibt 3 weitere Exemplare dieses Buches

Alle Suchergebnisse ansehen