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

Locating Two Facilities on a Tree Subject to Distance Constraints

Author

Listed:
  • E. Erkut

    (University of Alberta, Edmonton, Canada T6G 2R6)

  • R. L. Francis

    (University of Florida, Gainesville, Florida 32611)

  • T. J. Lowe

    (Purdue University, West Lafayette, Indiana 47906)

Abstract

We wish to locate two new facilities on a tree network, where demands occur at vertices. We minimize any convex function which is nondecreasing in two related single facility convex objective functions, and in the distance between the facilities, subject to a distance constraint imposing an upper bound on the distance between the facilities, as well as to distance constraints imposing upper bounds on the distances between the new facilities and the demand points. We consider both vertex-restricted and vertex-unrestricted problem versions, and, for the latter problem, reduce the location problem when the constraint is tight to a problem of locating a single new facility on a path.

Suggested Citation

  • E. Erkut & R. L. Francis & T. J. Lowe, 1988. "Locating Two Facilities on a Tree Subject to Distance Constraints," Transportation Science, INFORMS, vol. 22(3), pages 199-208, August.
    • Handle: RePEc:inm:ortrsc:v:22:y:1988:i:3:p:199-208
    DOI: 10.1287/trsc.22.3.199
    as

    Download full text from publisher

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

    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:22:y:1988:i:3:p:199-208. 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.