Articles liés à GEOMETRIC ALGORITHMS AND COMBINATORIAL OPTIMIZATION...
Synopsis
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 « Synopsis » peuvent faire référence à une autre édition de ce titre.
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.
Autres éditions populaires du même titre
Résultats de recherche pour GEOMETRIC ALGORITHMS AND COMBINATORIAL OPTIMIZATION...
Image fournie par le vendeur
Geometric Algorithms and Combinatorial Optimization Algorithms and Combinatorics, 2
Edité par
Springer, 1993
ISBN 10 : 3540567402
ISBN 13 : 9783540567400
Ancien ou d'occasion
gebundene Ausgabe
Vendeur : books4less (Versandantiquariat Petra Gros GmbH & Co. KG), Welling, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
gebundene Ausgabe. Etat : 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. N° de réf. du vendeur 2220370
Quantité disponible : 1 disponible(s)
Image d'archives
Geometric Algorithms and Combinatorial Optimization
Edité par
Springer Bln, 1993
ISBN 10 : 3540567402
ISBN 13 : 9783540567400
Ancien ou d'occasion
Couverture rigide
Vendeur : Buchpark, Trebbin, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Etat : Gut. Zustand: Gut | Seiten: 374 | Sprache: Englisch | Produktart: Bücher. N° de réf. du vendeur 347996/203
Quantité disponible : 1 disponible(s)