The minimum covering Euclidean ball of a set of Euclidean balls in $$I\!\!R^n$$ I R n

Dearing, P. M.; Cawood, Mark E.

The minimum covering Euclidean ball of a set of Euclidean balls in $$I\!\!R^n$$ I R n

P. M. Dearing () and Mark E. Cawood ()
Additional contact information
P. M. Dearing: Clemson University
Mark E. Cawood: Clemson University

Annals of Operations Research, 2023, vol. 322, issue 2, No 4, 659 pages

Abstract: Abstract Primal and dual algorithms are developed for solving the n-dimensional convex optimization problem of finding the Euclidean ball of minimum radius that covers m given Euclidean balls, each with given center and radius. Each algorithm is based on a directional search method in which a search path may be a ray or a two-dimensional conic section in $$I\!\!R^n$$ I R n . At each iteration, a search path is constructed by the intersection of bisectors of pairs of points, where the bisectors are either hyperplanes or n-dimensional hyperboloids. The optimal stopping point along each search path is determined explicitly.

Keywords: Location; Convex programming; Minimum covering ball; One-center location; Min–max location (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10479-022-05138-9 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:322:y:2023:i:2:d:10.1007_s10479-022-05138-9

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-022-05138-9

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().