scientific article; zbMATH DE number 1241836

zbMath0916.90205MaRDI QIDQ4225299

Nina Amenta, Günter M. Ziegler

Publication date: 18 January 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

simplex algorithmworst-case behaviourKlee-Minty cubesdeformed products of polytopes

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Linear programming (90C05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Blending simple polytopes at faces, Linear programming, the simplex algorithm and simple polytopes, The Polyhedral Geometry of Pivot Rules and Monotone Paths, Monotone paths on cross-polytopes, Polyhedral surfaces in wedge products, A Friendly Smoothed Analysis of the Simplex Method, Fiber polytopes for the projections between cyclic polytopes, George Dantzig's impact on the theory of computation, Equiprojective polyhedra, Prodsimplicial-neighborly polytopes, Projected products of polygons, Extended convex hull, Topological obstructions for vertex numbers of Minkowski sums, Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes, Efficient computation of a canonical form for a matrix with the generalized P-property, Computing monotone disjoint paths on polytopes, Moser's shadow problem, Convex subdivisions with low stabbing numbers, Pivot Rules for Circuit-Augmentation Algorithms in Linear Optimization