Computational results on an algorithm for finding all vertices of a polytope
- 1 December 1980
- journal article
- Published by Springer Science and Business Media LLC in Mathematical Programming
- Vol. 18 (1), 308-329
- https://doi.org/10.1007/bf01588326
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- The Probability that a Random Polytope is BoundedMathematics of Operations Research, 1977
- Polytope pairs and their relationship to linear programmingActa Mathematica, 1974
- An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear InequalitiesOperations Research, 1973
- Zufällige konvexe Polyeder imN-dimensionalen euklidischen RaumPeriodica Mathematica Hungarica, 1972
- Some results in probabilistic geometryProbability Theory and Related Fields, 1968