A MINIMAX LOCATION PROBLEM ON A NETWORK

We consider a network model of a system of transportation links, with nodes representing locations of existing facilities, and study the problem of finding a new facility location on the network that minimizes the maximum of linear increasing functions of the 'network distances' between the new facility and the existing facilities. The problem is formulated with respect to a metric space which is defined on the network, and a number of properties of the problem are developed. The properties lead to a new, simple algorithm for solving the problem when the network is a tree, and to a new, equivalent spanning tree problem for a general network. (Author)

• Supplemental Notes:
  • Availability: Pub. in unidentified publication, p333-343.
• Corporate Authors:

  University of Florida, Gainesville

  Gainesville, FL  United States  32611

  Army Research Office

  Box CM, Duke Station
  Durham, NC  United States  27706

  Cornell University

  College of Engineering
  Ithaca, NY  United States  14850
• Authors:
  • Dearing, P M
  • Francis, R L
• Publication Date: 1973-10

Media Info

• Pagination: 12 p.

Subject/Index Terms

• TRT Terms: Algorithms; Analysis; Information processing; Location; Mathematical models; Network analysis (Planning); Networks; Position fixing; Reprints; Roads; Transportation; Trees (Mathematics)
• Uncontrolled Terms: Transportation systems
• Old TRIS Terms: Computer analysis; Minimax technique
• Subject Areas: Administration and Management; Data and Information Technology; Operations and Traffic Management; Planning and Forecasting; Transportation (General);

Filing Info

• Accession Number: 00091910
• Record Type: Publication
• Source Agency: National Technical Information Service
• Contract Numbers: DAHC04-68-C-0002
• Files: TRIS
• Created Date: Sep 10 1976 12:00AM