IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v322y2023i2d10.1007_s10479-022-05138-9.html
   My bibliography  Save this article

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

Author

Listed:
  • P. M. Dearing

    (Clemson University)

  • Mark E. Cawood

    (Clemson University)

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.

Suggested Citation

  • P. M. Dearing & Mark E. Cawood, 2023. "The minimum covering Euclidean ball of a set of Euclidean balls in $$I\!\!R^n$$ I R n," Annals of Operations Research, Springer, vol. 322(2), pages 631-659, March.
    • Handle: RePEc:spr:annopr:v:322:y:2023:i:2:d:10.1007_s10479-022-05138-9
    DOI: 10.1007/s10479-022-05138-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-022-05138-9
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-022-05138-9?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Marta Cavaleiro & Farid Alizadeh, 2021. "A dual simplex-type algorithm for the smallest enclosing ball of balls," Computational Optimization and Applications, Springer, vol. 79(3), pages 767-787, July.
    2. D. Jack Elzinga & Donald W. Hearn, 1972. "The Minimum Covering Sphere Problem," Management Science, INFORMS, vol. 19(1), pages 96-104, September.
    3. Jack Elzinga & Donald W. Hearn, 1972. "Geometrical Solutions for Some Minimax Location Problems," Transportation Science, INFORMS, vol. 6(4), pages 379-394, November.
    4. Nimrod Megiddo, 1983. "The Weighted Euclidean 1-Center Problem," Mathematics of Operations Research, INFORMS, vol. 8(4), pages 498-504, November.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. M. Cera & J. A. Mesa & F. A. Ortega & F. Plastria, 2008. "Locating a Central Hunter on the Plane," Journal of Optimization Theory and Applications, Springer, vol. 136(2), pages 155-166, February.
    2. Blanco, Víctor & Puerto, Justo, 2021. "Covering problems with polyellipsoids: A location analysis perspective," European Journal of Operational Research, Elsevier, vol. 289(1), pages 44-58.
    3. Schnepper, Teresa & Klamroth, Kathrin & Stiglmayr, Michael & Puerto, Justo, 2019. "Exact algorithms for handling outliers in center location problems on networks using k-max functions," European Journal of Operational Research, Elsevier, vol. 273(2), pages 441-451.
    4. Miren Bilbao & Sergio Gil-López & Javier Ser & Sancho Salcedo-Sanz & Mikel Sánchez-Ponte & Antonio Arana-Castro, 2014. "Novel hybrid heuristics for an extension of the dynamic relay deployment problem over disaster areas," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 22(3), pages 997-1016, October.
    5. O Berman & Z Drezner, 2003. "A probabilistic one-centre location problem on a network," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(8), pages 871-877, August.
    6. Murray, Alan T., 2021. "Contemporary optimization application through geographic information systems," Omega, Elsevier, vol. 99(C).
    7. Zvi Drezner & Vladimir Marianov & George O. Wesolowsky, 2016. "Maximizing the minimum cover probability by emergency facilities," Annals of Operations Research, Springer, vol. 246(1), pages 349-362, November.
    8. Zvi Drezner & George Wesolowsky, 2014. "Covering Part of a Planar Network," Networks and Spatial Economics, Springer, vol. 14(3), pages 629-646, December.
    9. Callaghan, Becky & Salhi, Said & Nagy, Gábor, 2017. "Speeding up the optimal method of Drezner for the p-centre problem in the plane," European Journal of Operational Research, Elsevier, vol. 257(3), pages 722-734.
    10. Hamacher, H. W. & Nickel, S., 1996. "Multicriteria planar location problems," European Journal of Operational Research, Elsevier, vol. 94(1), pages 66-86, October.
    11. Cavalier, Tom M. & Conner, Whitney A. & del Castillo, Enrique & Brown, Stuart I., 2007. "A heuristic algorithm for minimax sensor location in the plane," European Journal of Operational Research, Elsevier, vol. 183(1), pages 42-55, November.
    12. Nikolai Krivulin, 2017. "Using tropical optimization to solve constrained minimax single-facility location problems with rectilinear distance," Computational Management Science, Springer, vol. 14(4), pages 493-518, October.
    13. Yunjia Ma & Wei Xu & Lianjie Qin & Xiujuan Zhao, 2019. "Site Selection Models in Natural Disaster Shelters: A Review," Sustainability, MDPI, vol. 11(2), pages 1-24, January.
    14. Frenk, J.B.G. & Gromicho, J.A.S. & Zhang, S., 1994. "A deep cut ellipsoid algorithm for convex programming," Econometric Institute Research Papers 11633, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    15. Tammy Drezner & Zvi Drezner, 2007. "Equity Models in Planar Location," Computational Management Science, Springer, vol. 4(1), pages 1-16, January.
    16. Elshaikh, Abdalla & Salhi, Said & Nagy, Gábor, 2015. "The continuous p-centre problem: An investigation into variable neighbourhood search with memory," European Journal of Operational Research, Elsevier, vol. 241(3), pages 606-621.
    17. Zvi Drezner & Pawel Kalczynski, 2017. "The continuous grey pattern problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(5), pages 469-483, May.
    18. Blanco, Víctor & Gázquez, Ricardo & Saldanha-da-Gama, Francisco, 2023. "Multi-type maximal covering location problems: Hybridizing discrete and continuous problems," European Journal of Operational Research, Elsevier, vol. 307(3), pages 1040-1054.
    19. Nguyen Mau Nam & Maria Cristina Villalobos & Nguyen Thai An, 2012. "Minimal Time Functions and the Smallest Intersecting Ball Problem with Unbounded Dynamics," Journal of Optimization Theory and Applications, Springer, vol. 154(3), pages 768-791, September.
    20. Kazuo Yamaguchi, 2022. "Spatial bargaining in rectilinear facility location problem," Theory and Decision, Springer, vol. 93(1), pages 69-104, July.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:322:y:2023:i:2:d:10.1007_s10479-022-05138-9. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.