IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v10y1976i4p321-336.html
   My bibliography  Save this article

Minimax Multifacility Location with Euclidean Distances

Author

Listed:
  • Jack Elzinga

    (The Johns Hopkins University, Baltimore, Maryland)

  • Donald Hearn

    (University of Florida, Gainesville, Florida)

  • W. D. Randolph

    (Washington, D. C.)

Abstract

The problem considered is that of locating N new facilities among M existing facilities with the objective of minimizing the maximum weighed Euclidean distance among all facilities. The application of nonlinear duality theory shows this problem can always be solved by maximizing a continuously differentiable concave objective subject to a small number of linear constraints. This leads to a solution procedure which produces very good numerical results. Computational experience is reported.

Suggested Citation

  • Jack Elzinga & Donald Hearn & W. D. Randolph, 1976. "Minimax Multifacility Location with Euclidean Distances," Transportation Science, INFORMS, vol. 10(4), pages 321-336, November.
    • Handle: RePEc:inm:ortrsc:v:10:y:1976:i:4:p:321-336
    DOI: 10.1287/trsc.10.4.321
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.10.4.321
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.10.4.321?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
    ---><---

    Citations

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


    Cited by:

    1. 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.
    2. 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.
    3. 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.
    4. Marianov, Vladimir & Eiselt, H.A., 2024. "Fifty Years of Location Theory - A Selective Review," European Journal of Operational Research, Elsevier, vol. 318(3), pages 701-718.
    5. Brazil, M. & Ras, C.J. & Thomas, D.A., 2014. "A geometric characterisation of the quadratic min-power centre," European Journal of Operational Research, Elsevier, vol. 233(1), pages 34-42.

    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:inm:ortrsc:v:10:y:1976:i:4:p:321-336. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.