LINEAR-TIME ALGORITHM FOR MAXIMUM FACILITY LOCATION ON TREE NETWORKS

This paper treats a topic in 'obnoxious facility location,' namely the problem of locating a single facility in an n-vertex tree network so as to maximize the sum of its weighted distances from the vertices. It is shown that use of a suitable data structure permits a solution algorithm with computational effort O(n), an improvement over the O(n squared) required by a previously indicated procedure.

  • Availability:
  • Corporate Authors:

    Operations Research Society of America

    428 East Preston Street
    Baltimore, MD  United States  21202
  • Authors:
    • Ting, S S
  • Publication Date: 1984-2

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 00387409
  • Record Type: Publication
  • Source Agency: Engineering Index
  • Files: TRIS
  • Created Date: Sep 28 1984 12:00AM