GEOMETRIC ALGORITHMS AND COMBINATIONAL OPTIMIZATION 2ND EDITION
Ouvrage 9783540567400 : GEOMETRIC ALGORITHMS AND COMBINATIONAL OPTIMIZATION 2ND EDITION
his 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
Auteur : GROTSCHEL
Editeur : SPRINGER VERLAG
Nombre de pages : 360
Date de publication : 01 1994
Toute la sélection
Toutes les sélections
Toute la sélection
Site réalisé en partenariat avec Courbis
(Courbis - alternate link), acteur de l'Internet depuis 1988...
Le Monde En Tique