The Minimum Covering Sphere Problem
From MaRDI portal
Publication:5653823
DOI10.1287/mnsc.19.1.96zbMath0242.90061OpenAlexW2133713273WikidataQ29031289 ScholiaQ29031289MaRDI QIDQ5653823
D. J. Elzinga, Donald W. Hearn
Publication date: 1972
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.19.1.96
Related Items
Calculating a minimal sphere containing a polytope defined by a system of linear inequalities, An efficient cutting plane algorithm for the smallest enclosing circle problem, Chebyshev approximation of a point set by a straight line, Approximations of differentiable convex functions on arbitrary convex polytopes, Novel hybrid heuristics for an extension of the dynamic relay deployment problem over disaster areas, Solving general continuous single facility location problems by cutting planes, Computational complexity of inner and outer \(j\)-radii of polytopes in finite-dimensional normed spaces, An efficient algorithm for the smallest enclosing ball problem in high dimensions, A dual algorithm for the minimum covering ball problem in \(\mathbb R^n\), A primal algorithm for the weighted minimum covering ball problem in \(\mathbb {R}^n\), An efficient inexact Newton-CG algorithm for the smallest enclosing ball problem of large dimensions, Minimum-volume ellipsoids containing compact sets: Application to parameter bounding, Duality results for extended multifacility location problems, Generalised entropy of curves for the analysis and classification of dynamical systems, On the planar piecewise quadratic 1-center problem, A bird's eye-view of min-max and max-min functionals, An improvement and an extension of the Elzinga \& Hearn's algorithm to the 1-center problem in \(\mathbb{R}^ n\) with \(l_{2b}\)-norms, Unnamed Item, Duality results for nonlinear single minimax location problems via multi-composed optimization, Local Gathering of Mobile Robots in Three Dimensions, Unifying gathering protocols for swarms of mobile robots, A new algorithm for the minimax location problem with the closest distance, The minimum covering Euclidean ball of a set of Euclidean balls in \(\mathbb{R}^n\), A dual algorithm for the minimum covering weighted ball problem in \({\mathbb{R}^n}\), On the elimination of inessential points in the smallest enclosing ball problem, Moment inequalities for random variables in computational geometry, On the ‘most normal’ normal, The 1-center problem in the plane with independent random weights, On the covering multiplicity of lattices, A recursive algorithm for finding the minimum covering sphere of a polytope and the minimum covering concentric spheres of several polytopes, Saddle points and overdetermined complex equations, Minimal ellipsoid circumscribing a polytope defined by a system of linear inequalities, Efficient algorithms for the smallest enclosing ball problem, Normative location theory: Placement in continuous space, Explizite Lösung des dreidimensionalen Minimax-Standortproblems in der City-Block-Distanz, Quality locations for the constrained minimax location model, Approximate minimum enclosing balls in high dimensions using core-sets, Chebyshev centres, Jung constants, and their applications, Special issue on Locational analysis, Location of rectilinear center trajectories, A new assignment rule to improve seed points algorithms for the continuous \(k\)-center problem, Continuous Center Problems, Optimal scaling of balls and polyhedra
