Geometric Algorithms And Combinatorial Optimization (Springer Series In Computational Mathematics) - Martin Grotschel
Springer (1988)
In Collection

Read It:
Combinatorial geometry, Geometry Of Numbers, Mathematical optimization, Programming (Mathematics)

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 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. The ellipsoid method was used by Khachiyan to show the polynomial time solvability of linear programming. The basis reduction method yields a polynomial time procedure for certain diophantine approximation problems.

Product Details
LoC Classification QA167 .G76 1988
Dewey 511/.6
Format Hardcover
Cover Price 69,00 €
No. of Pages 362
Height x Width 250 mm