ON THE VECTOR ASSIGNMENT P-MEDIAN PROBLEM

The vector assignment p-median problem allows nodes of a network to be served by a nonclosest facility. This Technical Note presents a counterexample to a proposition of J.R. Weaver and R.L. Church that an all-node solution always exists. It is shown that the proposition is true, however, if every node is served by closer facilities at least as often as by more distant facilities.

• Availability:
  • Find a library where document is available. Order URL: https://www.library.northwestern.edu/find-borrow-request/requests-interlibrary-loan/lending-institutions.html
• Authors:
  • Hooker, J N
  • Garfinkel, R S
• Publication Date: 1989-5

Media Info

• Features: References;
• Pagination: p. 139-140
• Serial:
  • Transportation Science
  • Volume: 23
  • Issue Number: 2
  • 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: Facilities; Location; Networks; Traffic assignment; Vector analysis
• Subject Areas: Highways; Planning and Forecasting; I72: Traffic and Transport Planning;

Filing Info

• Accession Number: 00485541
• Record Type: Publication
• Files: TRIS, ATRI
• Created Date: Jul 31 1989 12:00AM