The minimum sphere covering a convex polyhedron

DOI10.1002/nav.3800210414zbMath0295.90029OpenAlexW2018708907MaRDI QIDQ4048851

Jack Elzinga, Donald W. Hearn

Publication date: 1975

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800210414

Mathematics Subject Classification ID

Integer programming (90C10) Inequalities and extremum problems involving convexity in convex geometry (52A40)

Related Items (5)

Finding Minimum Volume Circumscribing Ellipsoids Using Generalized Copositive Programming ⋮ Robust Optimization for Models with Uncertain Second-Order Cone and Semidefinite Programming Constraints ⋮ Moment inequalities for random variables in computational geometry ⋮ On the covering multiplicity of lattices ⋮ Chebyshev center of the intersection of balls: complexity, relaxation and approximation

This page was built for publication: The minimum sphere covering a convex polyhedron