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

A Min-Max Theorem for p -Center Problems on a Tree

Author

Listed:
  • D. R. Shier

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

Abstract

This paper considers the problem of locating p facilities on a tree network in order to minimize the maximum distance from a point on the network to its nearest facility. Such a problem might arise, for example, in optimally locating a fixed number of fire hydrants along a street network. The present, paper identifies an underlying min-max theorem that governs such a p -center problem. More specifically, this p-center problem is shown to be equivalent to the “dual” problem of locating p + 1 points on the network so as to maximize the minimum distance between pairs of points.

Suggested Citation

  • D. R. Shier, 1977. "A Min-Max Theorem for p -Center Problems on a Tree," Transportation Science, INFORMS, vol. 11(3), pages 243-252, August.
    • Handle: RePEc:inm:ortrsc:v:11:y:1977:i:3:p:243-252
    DOI: 10.1287/trsc.11.3.243
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.11.3.243
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.11.3.243?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. Martí, Rafael & Martínez-Gavara, Anna & Pérez-Peló, Sergio & Sánchez-Oro, Jesús, 2022. "A review on discrete diversity and dispersion maximization from an OR perspective," European Journal of Operational Research, Elsevier, vol. 299(3), pages 795-813.
    2. Lei, Ting L. & Church, Richard L., 2015. "On the unified dispersion problem: Efficient formulations and exact algorithms," European Journal of Operational Research, Elsevier, vol. 241(3), pages 622-630.

    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:11:y:1977:i:3:p:243-252. 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.