On the Vector Assignment p -Median Problem

J. N. Hooker and R. S. Garfinkel
Additional contact information
J. N. Hooker: Carnegie Mellon University, Pittsburgh, Pennsylvania 15213
R. S. Garfinkel: University of Connecticut, Storrs, Connecticut 06268

Transportation Science, 1989, vol. 23, issue 2, 139-140

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

Date: 1989
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.23.2.139 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:23:y:1989:i:2:p:139-140

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().