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

DOI10.1016/J.ORL.2009.02.008zbMATH Open1167.90626OpenAlexW1971823973MaRDI QIDQ833570FDOQ833570

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Efficient algorithms for the smallest enclosing ball problem
• Linear Programming in Linear Time When the Dimension Is Fixed
• The Minimum Covering Sphere Problem
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• An efficient, exact, and generic quadratic programming solver for geometric optimization
• Algorithms - ESA 2003

Cited In (9)

• 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\)
• Title not available (Why is that?)
• A dual simplex-type algorithm for the smallest enclosing ball of balls
• 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
• Title not available (Why is that?)
• A dual algorithm for the minimum covering weighted ball problem in \({\mathbb{R}^n}\)

Uses Software

• Miniball

   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 👍 👎

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)