The Minimum Covering Sphere Problem

Cited in

(44)

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

This page was built for publication: The Minimum Covering Sphere Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5653823)