Mathematics of Operations Research · 1977 · 27 citations · 6 references
Natural SciencesComputer ScienceMathematicsCombinatoricsComputational GeometryProbability TheoryComputational StatisticsProbabilistic CombinatoricsProbability InequalitiesConstraintsPolyhedral CombinatoricsRandom Polytopes
A formula for the probability that a randomly generated n-polytope defined by m half-spaces is bounded is presented. Results of a simulation giving (i) the probability that all m constraints are relevant and (ii) a formula for the expected number of vertices of a polytope, are presented.
6
Blocking and anti-blocking pairs of polyhedra
D. R. Fulkerson · Mathematical Programming · 1971 · 540 citations
Partitions of<i>N</i>-Space by Hyperplanes
R. O. Winder · SIAM Journal on Applied Mathematics · 1966 · 104 citations