AN OPTIMAL ALGORITHM FOR WEIGHTED MINIMAX FLOW CENTERS ON TREES

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.

  • Availability:
  • Corporate Authors:

    Operations Research Society of America

    1314 Guilford Avenue
    Baltimore, MD  United States  21202
  • Authors:
    • EISELT, H A
    • Gendreau, M
  • Publication Date: 1991-11

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 00618625
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Jan 31 1992 12:00AM