IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v44y1997i4p341-352.html
   My bibliography  Save this article

Polynomial algorithms for center location on spheres

Author

Listed:
  • Mordechai Jaeger
  • Jeff Goldberg

Abstract

When locating facilities over the earth or in space, a planar location model is no longer valid and we must use a spherical surface. In this article, we consider the one‐and two‐center problems on a sphere that contains n demand points. The problem is to locate facilities to minimize the maximum distance from any demand point to the closest facility. We present an O(n) algorithm for the one‐center problem when a hemisphere contains all demand points and also give an O(n) algorithm for determining whether or not the hemisphere property holds. We present an O(n3 log n) algorithm for the two‐center problem for arbitrarily located demand points. Finally, we show that for general p, the p center on a sphere problem is NP‐hard. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 341–352, 1997

Suggested Citation

  • Mordechai Jaeger & Jeff Goldberg, 1997. "Polynomial algorithms for center location on spheres," Naval Research Logistics (NRL), John Wiley & Sons, vol. 44(4), pages 341-352, June.
    • Handle: RePEc:wly:navres:v:44:y:1997:i:4:p:341-352
    DOI: 10.1002/(SICI)1520-6750(199706)44:43.0.CO;2-6
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/(SICI)1520-6750(199706)44:43.0.CO;2-6
    Download Restriction: no
    File URL: https://libkey.io/10.1002/(SICI)1520-6750(199706)44:43.0.CO;2-6?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
    ---><---

    References listed on IDEAS

    as
    1. Minnie H. Patel & Deborah L. Nettles & Stuart J. Deutsch, 1993. "A linear‐programming‐based method for determining whether or not n demand points are on a hemisphere," Naval Research Logistics (NRL), John Wiley & Sons, vol. 40(4), pages 543-552, June.
    2. Zvi Drezner & George O. Wesolowsky, 1983. "Minimax and maximin facility location problems on a sphere," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 30(2), pages 305-312, June.
    3. Zvi Drezner, 1981. "Technical Note—On Location Dominance on Spherical Surfaces," Operations Research, INFORMS, vol. 29(6), pages 1218-1219, December.
    4. Wen-Hsien Tsai & Maw-Sheng Chern & Tsong-Ming Lin, 1991. "Technical Note—An Algorithm for Determining Whether m Given Demand Points Are on a Hemisphere or Not," Transportation Science, INFORMS, vol. 25(1), pages 91-97, February.
    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. Minnie H. Patel & Deborah L. Nettles & Stuart J. Deutsch, 1993. "A linear‐programming‐based method for determining whether or not n demand points are on a hemisphere," Naval Research Logistics (NRL), John Wiley & Sons, vol. 40(4), pages 543-552, June.
    2. Zvi Drezner, 1988. "Location strategies for satellites' orbits," Naval Research Logistics (NRL), John Wiley & Sons, vol. 35(5), pages 503-512, October.
    3. Franco Rubio-López & Obidio Rubio & Rolando Urtecho Vidaurre, 2023. "The Inverse Weber Problem on the Plane and the Sphere," Mathematics, MDPI, vol. 11(24), pages 1-23, December.
    4. Pawel Kalczynski & Atsuo Suzuki & Zvi Drezner, 2023. "Obnoxious facility location in multiple dimensional space," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 31(2), pages 331-354, July.
    5. O. P. Ferreira & S. Z. Németh, 2019. "On the spherical convexity of quadratic functions," Journal of Global Optimization, Springer, vol. 73(3), pages 537-545, March.
    6. Nguyen Thai An & Nguyen Mau Nam & Xiaolong Qin, 2020. "Solving k-center problems involving sets based on optimization techniques," Journal of Global Optimization, Springer, vol. 76(1), pages 189-209, January.
    7. Drezner, Zvi & Kalczynski, Pawel & Salhi, Said, 2019. "The planar multiple obnoxious facilities location problem: A Voronoi based heuristic," Omega, Elsevier, vol. 87(C), pages 105-116.
    8. Pawel Kalczynski & Zvi Drezner, 2021. "The obnoxious facilities planar p-median problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 43(2), pages 577-593, June.

    More about this item

    Statistics

    Access and download statistics

    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:wly:navres:v:44:y:1997:i:4:p:341-352. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    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.