IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v23y1977i10p1133-1142.html
   My bibliography  Save this article

The m-Center Problem: Minimax Facility Location

Author

Listed:
  • R. S. Garfinkel

    (University of Tennessee)

  • A. W. Neebe

    (University of North Carolina)

  • M. R. Rao

    (University of Rochester and Indian Institute of Management, Bangalore, India)

Abstract

The m-Center Problem is to locate a given number of (emergency) facilities anywhere along a road network so as to minimize the maximum distance between these facilities and fixed demand locations assigned to them. Fundamental properties of the m-Center Problem are examined. The problem is modeled using integer programming, and is successfully attacked using a binary search technique and a combination of exact tests and heuristics. Computational results are given.

Suggested Citation

  • R. S. Garfinkel & A. W. Neebe & M. R. Rao, 1977. "The m-Center Problem: Minimax Facility Location," Management Science, INFORMS, vol. 23(10), pages 1133-1142, June.
    • Handle: RePEc:inm:ormnsc:v:23:y:1977:i:10:p:1133-1142
    DOI: 10.1287/mnsc.23.10.1133
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.23.10.1133
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.23.10.1133?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. Bo Zhang & Jin Peng & Shengguo Li, 2021. "Minimax models for capacitated p-center problem in uncertain environment," Fuzzy Optimization and Decision Making, Springer, vol. 20(3), pages 273-292, September.
    2. Gaar, Elisabeth & Sinnl, Markus, 2022. "A scaleable projection‐based branch‐and‐cut algorithm for the p‐center problem," European Journal of Operational Research, Elsevier, vol. 303(1), pages 78-98.
    3. Elena Fernandez & Robert Garfinkel & Roman Arbiol, 1998. "Mosaicking of Aerial Photographic Maps Via Seams Defined by Bottleneck Shortest Paths," Operations Research, INFORMS, vol. 46(3), pages 293-304, June.
    4. Xiang Li & Fahui Wang & Hong Yi, 2017. "A two-step approach to planning new facilities towards equal accessibility," Environment and Planning B, , vol. 44(6), pages 994-1011, November.
    5. Berman, Oded & Sanajian, Nima & Wang, Jiamin, 2017. "Location choice and risk attitude of a decision maker," Omega, Elsevier, vol. 66(PA), pages 170-181.
    6. Bhuvnesh Sharma & M. Ramkumar & Nachiappan Subramanian & Bharat Malhotra, 2019. "Dynamic temporary blood facility location-allocation during and post-disaster periods," Annals of Operations Research, Springer, vol. 283(1), pages 705-736, December.
    7. Joseph S. Martinich, 1988. "A vertex‐closing approach to the p‐center problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 35(2), pages 185-201, April.

    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:ormnsc:v:23:y:1977:i:10:p:1133-1142. 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.