𝔖 Scriptorium
✦   LIBER   ✦
📁

Geometric algorithms and combinatorial optimization

✍ Scribed by Martin Grotschel

Publisher
Springer
Year
1988
Tongue
English
Leaves
376
Series
Springer Series in Computational Mathematics
Category
Library
⬇  Acquire This Volume

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Geometric Algorithms and Combinatorial O
📁 Geometric Algorithms and Combinatorial Optimization, Second Edition (Algorithms and Combinatorics)
✍ Martin Grötschel, Laszlo Lovasz, Alexander Schrijver 📂 Library 📅 1993 🏛 Springer 🌐 English

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 poin

Geometric Algorithms and Combinatorial O
📁 Geometric Algorithms and Combinatorial Optimization, Second Edition (Algorithms and Combinatorics)
✍ Martin Grötschel, Laszlo Lovasz, Alexander Schrijver 📂 Library 📅 1993 🏛 Springer 🌐 English

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 poin

Geometric Algorithms and Combinatorial O
📁 Geometric Algorithms and Combinatorial Optimization
✍ Martin Grötschel, László Lovász, Alexander Schrijver (auth.) 📂 Library 📅 1993 🏛 Springer-Verlag Berlin Heidelberg 🌐 English

<p>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