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

A Round-Trip Location Problem on a Tree Graph

Author

Listed:
  • Albert W. Chan

    (University of Windsor, Windsor, Ontario, Canada)

  • Richard L. Francis

    (The University of Florida, Gainesville, Florida)

Abstract

The problem considered is to locate one new facility with respect to a finite number of pairs of existing facilities on, a tree graph, which typically represents a road network, so as to minimize the maximum cost, where cost are linear increasing functions of the round-trip distance a vehicle based at the new facility travels via a pair of existing facilities. Based on an attainable lower bound for the minimax problem, an algorithm is developed that yields all optimal solutions to the problem.

Suggested Citation

  • Albert W. Chan & Richard L. Francis, 1976. "A Round-Trip Location Problem on a Tree Graph," Transportation Science, INFORMS, vol. 10(1), pages 35-51, February.
    • Handle: RePEc:inm:ortrsc:v:10:y:1976:i:1:p:35-51
    DOI: 10.1287/trsc.10.1.35
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.10.1.35
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.10.1.35?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. Nagy, Gabor & Salhi, Said, 2007. "Location-routing: Issues, models and methods," European Journal of Operational Research, Elsevier, vol. 177(2), pages 649-672, March.
    2. Hakimi, S.Louis, 1983. "Network location theory and contingency planning," Energy, Elsevier, vol. 8(8), pages 697-702.

    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:1:p:35-51. 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.