Geometric algorithms and combinatorial optimization: M. Grötschel, L. Lovász, and A. Schrijver, Springer-Verlag, 1988, 362 pp.

Groetschel, M., L. Lovasz, A. Schrijver:

Groetschel, M., L. Lovasz, A. Schrijver: Geometric Algorithms and Combinatorial Optimization. (Algorithms and Combinatorics. Eds.: R. L. Graham, B. Korte, L. Lovasz. Vol. 2), Springer-Verlag 1988, XII, 362 pp., 23 Figs., DM 148,-. ISBN 3–540–13624-X

✍ D. Seese 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 71 KB

I n the last yearsgeometric techniques for proving polynomial time solvability of problems in convexity theory, geometry and combinatorial optimization attained wide acceptance. Especially the sensational result of L. G. Khachiyan t h a t linear programs are solvable in polynomial time using