Polytope pairs and their relationship to linear programming

Acta Mathematica

Volumn 133, Issue 1, 1974, Pages 1-25

  Klee, Victor ^a  

^a UNIVERSITY OF WASHINGTON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0039649391     PISSN: 00015962     EISSN: 18712509     Source Type: Journal    
DOI: 10.1007/BF02392139     Document Type: Article

References (27)

1. The minimum number of vertices of a simple polytope
2. Graph theorems for manifolds
3. Historical note on a recurrent combinatorial problem
4. Shellable decompositions of cells and spheres
5. Eight unsolved problems from mathematical programming
6. Neighboring vertices on a convex polyhedron
7. Neighborly and cyclic polytopes
8. On the number of faces of a convex polytope
9. An enumeration of simplicial 4-polytopes with 8 vertices
10. On the enumeration of X-edra having triedal summits and an (x−1)-gonal base
11. On the partitions of the R-pyramid, being the first class of R-gonous X-edra
12. Diameters of polyhedral graphs
13. On the number of vertices of a convex polytope
14. Convex polytopes and linear programming
15. A comparison of primal and dual methods for linear programming
16. How good is the simplex algorithm?
17. The d-step conjecture for polyhedra of dimension d<6
18. Finding all vertices of a convex polyhedron
19. An algorithm for determining irrelevant constraints and all vertices in systems of linear inequalities
20. The maximum number of faces of a convex polytope
21. Cooperative classes of finite sets in one and more dimensions
22. Bounds assuring subsets in convex position
23. Algebraic characterization of some classical combinatorial problems
24. On the number of certain types of polyhedra
25. Incidence graphs of convex polytopes