Polytope pairs and their relationship to linear programming
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3121295 (Why is no real title available?)
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 3466805 (Why is no real title available?)
- scientific article; zbMATH DE number 3261280 (Why is no real title available?)
- A comparison of primal and dual methods of linear programming
- Algebraic Characterization of Some Classical Combinatorial Problems
- An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear Inequalities
- An enumeration of simplicial 4-polytopes with 8 vertices
- Bounds assuring subsets in convex position
- Cooperative classes of finite sets in one and more dimensions
- Diameters of Polyhedral Graphs
- Finding all vertices of a convex polyhedron
- Graph theorems for manifolds
- Historical Note on a Recurrent Combinatorial Problem
- Incidence graphs of convex polytopes
- On The Number of Faces of a Convex Polytope
- On the Number of Vertices of a Convex Polytope
- On the number of certain types of polyhedra
- Shellable Decompositions of Cells and Spheres.
- The \(d\)-step conjecture for polyhedra of dimension \(d<6\)
- The maximum numbers of faces of a convex polytope
- The minimum number of vertices of a simple polytope
Cited in
(17)- The number of faces of polytope pairs and unbounded polyhedra
- Stellare Abänderungen und Schälbarkeit von Komplexen und Polytopen
- Bounds on the number of vertices of perturbed polyhedra
- Gale diagrams of convex polytopes and positive spanning sets of vectors
- A proof of the sufficiency of McMullen's conditions for f-vectors of simplicial convex polytopes
- A method of Euclidean centers
- The minimum number of faces of a simple polyhedron
- On the complexity of d-dimensional Voronoi diagrams
- The excess degree of a polytope
- Expected Number of Vertices of a Random Convex Polyhedron
- On the complexity of computing the diameter of a polytope
- Computational results on an algorithm for finding all vertices of a polytope
- Rigidity and the lower bound theorem. I
- How good are convex hull algorithms?
- Bounds on the complexity of halfspace intersections when the bounded faces have small dimension
- A lower bound theorem for polytope pairs
- Sufficiency of McMullen’s conditions for 𝑓-vectors of simplicial polytopes
This page was built for publication: Polytope pairs and their relationship to linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1218333)
