CONDITIONAL LOCATION PROBLEMS ON NETWORKS. TECHNICAL NOTE

This paper presents an algorithm for solving conditional location problems (such as the conditional p-median problem or the conditional p-center problem) on networks, where demand points are served by the closest facility whether existing or new. This algorithm requires the one-time solution of a (p + 1)-unconditional corresponding location problem using an appropriate shortest distance matrix.

• Availability:
  • Find a library where document is available. Order URL: http://worldcat.org/oclc/1767714
• Corporate Authors:

  Operations Research Society of America

  Mount Royal and Guilford Avenue
  Baltimore, MD  United States  21202
• Authors:
  • Berman, O
  • SIMCHI-LEVI, D
• Publication Date: 1990-2

Media Info

• Features: References;
• Pagination: p. 77-78
• Serial:
  • Transportation Science
  • Volume: 24
  • Issue Number: 1
  • Publisher: Institute for Operations Research and the Management Sciences (INFORMS)
  • ISSN: 0041-1655
  • Serial URL: http://transci.journal.informs.org/

Subject/Index Terms

• TRT Terms: Algorithms; Facilities; Location; Networks
• Old TRIS Terms: Conditional location problems
• Subject Areas: Highways; Planning and Forecasting; I72: Traffic and Transport Planning;

Filing Info

• Accession Number: 00491744
• Record Type: Publication
• Files: TRIS
• Created Date: Mar 31 1990 12:00AM