The aim of this volume is to reinforce the interaction between the three main branches (abstract, convex and computational) of the theory of polytopes. The articles include contributions from many experts in the field, and their topics of concern are expositions of recent results and in-depth analyses of the development (past and future) of the subject. 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. This text should be of interest to researchers in applied and computational convexity, convex geometry and discrete geometry at the graduate and postgraduate levels.