An Optimal Algorithm for Weighted Minimax Flow Centers on Trees

Horst A. Eiselt and Michel Gendreau
Additional contact information
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

Transportation Science, 1991, vol. 25, issue 4, 314-316

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.

Date: 1991
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.25.4.314 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:25:y:1991:i:4:p:314-316

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().