Naval Research Logistics Quarterly · 1974 · 16 citations · 6 references
Mathematical ProgrammingGeometric ModelingDiscrete GeometryEngineeringGeometric AlgorithmGeometryConvex PolyhedronNatural SciencesConvex OptimizationConvex HullComputer ScienceDiscrete MathematicsA Finite AlgorithmCombinatorial OptimizationComputational GeometryLinear ProgrammingExtreme Points
Abstract A finite algorithm is given for finding the smallest sphere enclosing a convex polyhedron in E n described by a given system of linear equalities or inequalities. Extreme points of the polyhedron, and minimum spheres enclosing them, are generated in a systematic manner until the optimum is attained.
6
Robert J. Buehler, Douglass J. Wilde · Econometrica · 1965 · 701 citations
Artificial Intelligence, Engineering, Information Retrieval +8
The Minimum Covering Sphere Problem
D. Jack Elzinga, Donald W. Hearn · Management Science · 1972 · 183 citations
Mathematical Programming, Discrete Geometry, Location Theory +13