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

Relaxation method for the solution of the minimax location‐allocation problem in euclidean space

Author

Listed:
  • R. Chen
  • G. Y. Handler

Abstract

A method previously devised for the solution of the p‐center problem on a network has now been extended to solve the analogous minimax location‐allocation problem in continuous space. The essence of the method is that we choose a subset of the n points to be served and consider the circles based on one, two, or three points. Using a set‐covering algorithm we find a set of p such circles which cover the points in the relaxed problem (the one with m

Suggested Citation

  • R. Chen & G. Y. Handler, 1987. "Relaxation method for the solution of the minimax location‐allocation problem in euclidean space," Naval Research Logistics (NRL), John Wiley & Sons, vol. 34(6), pages 775-788, December.
    • Handle: RePEc:wly:navres:v:34:y:1987:i:6:p:775-788
    DOI: 10.1002/1520-6750(198712)34:63.0.CO;2-N
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/1520-6750(198712)34:63.0.CO;2-N
    Download Restriction: no
    File URL: https://libkey.io/10.1002/1520-6750(198712)34:63.0.CO;2-N?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. Jack Elzinga & Donald W. Hearn, 1972. "Geometrical Solutions for Some Minimax Location Problems," Transportation Science, INFORMS, vol. 6(4), pages 379-394, November.
    2. Jack Elzinga & Donald Hearn & W. D. Randolph, 1976. "Minimax Multifacility Location with Euclidean Distances," Transportation Science, INFORMS, vol. 10(4), pages 321-336, November.
    3. Zvi Drezner, 1984. "The Planar Two-Center and Two-Median Problems," Transportation Science, INFORMS, vol. 18(4), pages 351-361, November.
    4. Reuven Chen, 1983. "Solution of minisum and minimax location–allocation problems with Euclidean distances," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 30(3), pages 449-459, September.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Man Yu & Yafang Lv & Yanping Zhao & Chan He & Senlin Wu, 2023. "Estimations of Covering Functionals of Convex Bodies Based on Relaxation Algorithm," Mathematics, MDPI, vol. 11(9), pages 1-15, April.
    2. Marilène Cherkesly & Claudio Contardo, 2021. "The conditional p-dispersion problem," Journal of Global Optimization, Springer, vol. 81(1), pages 23-83, September.
    3. 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.
    4. R. Chen & Y. Handler, 1993. "The conditional p‐center problem in the plane," Naval Research Logistics (NRL), John Wiley & Sons, vol. 40(1), pages 117-127, February.
    5. Chen, Doron & Chen, Reuven, 2013. "Optimal algorithms for the α-neighbor p-center problem," European Journal of Operational Research, Elsevier, vol. 225(1), pages 36-43.
    6. 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.
    7. Pelegrin, B. & Canovas, L., 1998. "A new assignment rule to improve seed points algorithms for the continuous k-center problem," European Journal of Operational Research, Elsevier, vol. 104(2), pages 366-374, January.

    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. 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.
    2. Zvi Drezner, 1987. "On the rectangular p‐center problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 34(2), pages 229-234, April.
    3. Tammy Drezner & Zvi Drezner, 2016. "Sequential location of two facilities: comparing random to optimal location of the first facility," Annals of Operations Research, Springer, vol. 246(1), pages 5-18, November.
    4. 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.
    5. 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.
    6. Jack Brimberg & Pierre Hansen & Nenad Mladenović & Eric D. Taillard, 2000. "Improvements and Comparison of Heuristics for Solving the Uncapacitated Multisource Weber Problem," Operations Research, INFORMS, vol. 48(3), pages 444-460, June.
    7. Zvi Drezner & Jack Brimberg & Nenad Mladenović & Said Salhi, 2016. "New local searches for solving the multi-source Weber problem," Annals of Operations Research, Springer, vol. 246(1), pages 181-203, November.
    8. Zvi Drezner & G. O. Wesolowsky, 1991. "Facility location when demand is time dependent," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(5), pages 763-777, October.
    9. Murray, Alan T., 2021. "Contemporary optimization application through geographic information systems," Omega, Elsevier, vol. 99(C).
    10. Kalczynski, Pawel & Drezner, Zvi, 2022. "The Obnoxious Facilities Planar p-Median Problem with Variable Sizes," Omega, Elsevier, vol. 111(C).
    11. Zvi Drezner & Said Salhi, 2017. "Incorporating neighborhood reduction for the solution of the planar p-median problem," Annals of Operations Research, Springer, vol. 258(2), pages 639-654, November.
    12. R. L. Francis & T. J. Lowe & Arie Tamir, 2000. "Aggregation Error Bounds for a Class of Location Models," Operations Research, INFORMS, vol. 48(2), pages 294-307, April.
    13. 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.
    14. Drexl, Andreas & Klose, Andreas, 2001. "Facility location models for distribution system design," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 546, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    15. Li, Lushu & Kabadi, S. N. & Nair, K. P. K., 2002. "Fuzzy versions of the covering circle problem," European Journal of Operational Research, Elsevier, vol. 137(1), pages 93-109, February.
    16. Zvi Drezner & George Wesolowsky, 2014. "Covering Part of a Planar Network," Networks and Spatial Economics, Springer, vol. 14(3), pages 629-646, December.
    17. Zvi Drezner & Jack Brimberg & Nenad Mladenović & Said Salhi, 2015. "Solving the planar p-median problem by variable neighborhood and concentric searches," Journal of Global Optimization, Springer, vol. 63(3), pages 501-514, November.
    18. 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.
    19. ReVelle, C. S. & Eiselt, H. A., 2005. "Location analysis: A synthesis and survey," European Journal of Operational Research, Elsevier, vol. 165(1), pages 1-19, August.
    20. Cem Iyigun, 2013. "The planar hub location problem: a probabilistic clustering approach," Annals of Operations Research, Springer, vol. 211(1), pages 193-207, December.

    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:34:y:1987:i:6:p:775-788. 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.