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

DOI10.1016/j.orl.2009.02.008zbMath1167.90626OpenAlexW1971823973MaRDI QIDQ833570

P. M. Dearing, Christiane R. Zeck

Publication date: 14 August 2009

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2009.02.008

zbMATH Keywords

min-max locationminimum covering ballone-center location

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (6)

A primal algorithm for the weighted minimum covering ball problem in \(\mathbb {R}^n\) ⋮ A branch-and-bound method for the minimum \(k\)-enclosing ball problem ⋮ A hybrid algorithm for the minimum bounding sphere problem ⋮ 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}\) ⋮ A dual simplex-type algorithm for the smallest enclosing ball of balls

Uses Software

• Miniball

Cites Work

• Unnamed Item
• Unnamed Item
• Efficient algorithms for the smallest enclosing ball problem
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• Linear Programming in Linear Time When the Dimension Is Fixed
• An efficient, exact, and generic quadratic programming solver for geometric optimization
• The Minimum Covering Sphere Problem
• Algorithms - ESA 2003

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