A primal algorithm for the weighted minimum covering ball problem in \(\mathbb {R}^n\)

DOI10.1007/s11750-015-0405-9zbMath1462.90125OpenAlexW2191155632MaRDI QIDQ301399

Pietro Belotti, P. M. Dearing, Andrea M. Smith

Publication date: 30 June 2016

Published in: Top (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11750-015-0405-9

zbMATH Keywords

nonlinear programmingVoronoi diagrammin-max locationminimum covering ballone-center location

Mathematics Subject Classification ID

Nonlinear programming (90C30) Discrete location and assignment (90B80)

Related Items

On farthest Bregman Voronoi cells, A radius of robust feasibility for uncertain farthest Voronoi cells, On farthest Voronoi cells

Uses Software

• Matlab
• AMPL
• Ipopt
• Miniball

Cites Work

• Unnamed Item
• Unnamed Item
• A dual algorithm for the minimum covering ball problem in \(\mathbb R^n\)
• An algorithm for finding the Chebyshev center of a convex polyhedron
• Efficient algorithms for the smallest enclosing ball problem
• A dual algorithm for the minimum covering weighted ball problem in \({\mathbb{R}^n}\)
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• The Weighted Euclidean 1-Center Problem
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• Linear Programming in Linear Time When the Dimension Is Fixed
• Efficient Algorithms for the (Weighted) Minimum Circle Problem
• New Finite Pivoting Rules for the Simplex Method
• An efficient, exact, and generic quadratic programming solver for geometric optimization
• The Minimum Covering Sphere Problem
• Algorithms - ESA 2003