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

Minimax Location of a Facility in a Network

Author

Listed:
  • A. J. Goldman

    (National Bureau of Standards, Washington, D.C.)

Abstract

The problem is that of locating a facility in a network N so as to minimize the largest of its distances from the vertices of N . A method is given that either solves the problem, or else reduces it to an analogous problem for a single “cyclic component” of N . When N is acyclic (a tree), a very efficient solution algorithm results. Partial analogs of these results are given for a “weighted-distance” extension of the problem.

Suggested Citation

  • A. J. Goldman, 1972. "Minimax Location of a Facility in a Network," Transportation Science, INFORMS, vol. 6(4), pages 407-418, November.
    • Handle: RePEc:inm:ortrsc:v:6:y:1972:i:4:p:407-418
    DOI: 10.1287/trsc.6.4.407
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.6.4.407
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.6.4.407?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. Mulder, H.M. & Pelsmajer, M.J. & Reid, K.B., 2006. "Generalized centrality in trees," Econometric Institute Research Papers EI 2006-16, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    2. Wei Ding & Ke Qiu, 2017. "An FPTAS for generalized absolute 1-center problem in vertex-weighted graphs," Journal of Combinatorial Optimization, Springer, vol. 34(4), pages 1084-1095, November.
    3. ReVelle, C.S. & Eiselt, H.A. & Daskin, M.S., 2008. "A bibliography for some fundamental problem categories in discrete location science," European Journal of Operational Research, Elsevier, vol. 184(3), pages 817-848, February.
    4. Wei Ding & Ke Qiu & Yu Zhou & Zhou Ye, 2022. "A sifting-edges algorithm for accelerating the computation of absolute 1-center in graphs," Journal of Combinatorial Optimization, Springer, vol. 44(2), pages 905-920, September.
    5. Lin, Hongying & Zhou, Bo, 2021. "Which numbers are status differences?," Applied Mathematics and Computation, Elsevier, vol. 399(C).
    6. 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.
    7. Hyunwoo Lim & Narushige Shiode, 2011. "Parcel Distribution Networks for Online Shopping Business," Chapters, in: Kenneth Button & Aura Reggiani (ed.), Transportation and Economic Development Challenges, chapter 6, Edward Elgar Publishing.
    8. Jesús Muñuzuri & Pablo Cortés & Rafael Grosso & Luis Onieva, 2016. "Teaching Heuristic Methods to Industrial Engineers: A Problem-Based Experience," INFORMS Transactions on Education, INFORMS, vol. 16(2), pages 60-67, January.
    9. Chiang Lin & Wei-Han Tsai & Jen-Ling Shang & Yuan-Jen Zhang, 2012. "Minimum statuses of connected graphs with fixed maximum degree and order," Journal of Combinatorial Optimization, Springer, vol. 24(3), pages 147-161, October.

    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:6:y:1972:i:4:p:407-418. 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.