A dual algorithm for the minimum covering ball problem in R^n

DOI10.1016/J.ORL.2009.02.008MaRDI QIDQ833570zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• A dual algorithm for the minimum covering weighted ball problem in \({\mathbb{R}^n}\)
• The minimum covering Euclidean ball of a set of Euclidean balls in \(\mathbb{R}^n\)
• A primal algorithm for the weighted minimum covering ball problem in \(\mathbb {R}^n\)
• A recursive algorithm for finding the minimum covering sphere of a polytope and the minimum covering concentric spheres of several polytopes
• A dual simplex-type algorithm for the smallest enclosing ball of balls

Cites work

• scientific article; zbMATH DE number 1803755 (Why is no real title available?)
• scientific article; zbMATH DE number 1424293 (Why is no real title available?)
• Algorithms - ESA 2003
• An efficient, exact, and generic quadratic programming solver for geometric optimization
• Efficient algorithms for the smallest enclosing ball problem
• Linear Programming in Linear Time When the Dimension Is Fixed
• Linear-Time Algorithms for Linear Programming in R^3 and Related Problems
• The Minimum Covering Sphere Problem

Cited in

(12)

• A recursive algorithm for finding the minimum covering sphere of a polytope and the minimum covering concentric spheres of several polytopes
• A primal algorithm for the weighted minimum covering ball problem in \(\mathbb {R}^n\)
• A faster dual algorithm for the Euclidean minimum covering ball problem
• A dual simplex-type algorithm for the smallest enclosing ball of balls
• scientific article; zbMATH DE number 5670055 (Why is no real title available?)
• A branch-and-bound method for the minimum \(k\)-enclosing ball problem
• The minimum covering Euclidean ball of a set of Euclidean balls in \(\mathbb{R}^n\)
• A hybrid algorithm for the minimum bounding sphere problem
• scientific article; zbMATH DE number 1138448 (Why is no real title available?)
• The 2-center problem in three dimensions
• A dual algorithm for the minimum covering weighted ball problem in \({\mathbb{R}^n}\)
• A note on the support vector data description problem

Describes a project that uses

Uses Software

• Miniball

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

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