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

DOI10.1007/s10898-011-9796-9zbMath1268.90086OpenAlexW2055822847MaRDI QIDQ1941021

Andrea M. Smith, P. M. Dearing

Publication date: 11 March 2013

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-011-9796-9

zbMATH Keywords

nonlinear programmingmin-max locationminimum covering ballone-center location

Mathematics Subject Classification ID

Continuous location (90B85) Nonlinear programming (90C30)

Related Items (1)

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

Uses Software

• Miniball

Cites Work

• A dual algorithm for the minimum covering ball problem in \(\mathbb R^n\)
• Efficient algorithms for the smallest enclosing ball problem
• 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
• An efficient, exact, and generic quadratic programming solver for geometric optimization
• The Minimum Covering Sphere Problem
• Algorithms - ESA 2003
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A dual algorithm for the minimum covering weighted ball problem in \({\mathbb{R}^n}\)