The subject matter of the book ranges from algorithms for assignment and transportation problems to the introduction of a geometric theory of polyhedra which need not be convex.
With polytopes as the main topic of interest, there are articles on realizations, classifications, Eulerian posets, polyhedral subdivisions, generalized stress, the Brunn--Minkowski theory, asymptotic approximations and the computation of volumes and mixed volumes.
For researchers in applied and computational convexity, convex geometry and discrete geometry at the graduate and postgraduate levels.
Number of pages: 507
Weight: 833 g
Dimensions: 240 x 160 x 27 mm
Edition: Softcover reprint of the original 1st ed. 199
You may also be interested in...
Please sign in to write a review