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

An Optimal Algorithm for Weighted Minimax Flow Centers on Trees

Author

Listed:
  • Horst A. Eiselt

    (University of New Brunswick, Fredericton, NB, E3B 5A3, Canada)

  • Michel Gendreau

    (Université de Montréal, Montréal, Québec, H3C 3J7, Canada)

Abstract

Let a tree be given with supplies assigned to its nodes and weights assigned to its edges. The problem considered here is to locate a facility, so that the flow pattern which results from shipping all supplies to the facility, is such that it minimizes the largest weighted flow on any individual edge. First some properties of such facility locations are derived and then a linear time algorithm for their determination along with the associated flow pattern is given.

Suggested Citation

  • Horst A. Eiselt & Michel Gendreau, 1991. "An Optimal Algorithm for Weighted Minimax Flow Centers on Trees," Transportation Science, INFORMS, vol. 25(4), pages 314-316, November.
    • Handle: RePEc:inm:ortrsc:v:25:y:1991:i:4:p:314-316
    DOI: 10.1287/trsc.25.4.314
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.25.4.314
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.25.4.314?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:25:y:1991:i:4:p:314-316. 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.