Optimal Center Location in Simple Networks

A. J. Goldman
Additional contact information
A. J. Goldman: National Bureau of Standards, Washington, D.C.

Transportation Science, 1971, vol. 5, issue 2, 212-221

Abstract: The general problem is that of locating a central facility in a network so as to minimize the sum of its distances from the sources of flow to it, each distance being appropriately weighted to reflect the associated flow volume and/or cost. In this paper, simple one-pass solution algorithms are given for two classes of topologically simple networks, namely those which are either acyclic or contain exactly one cycle. The first algorithm is based on a reduction procedure that may also yield useful simplification of problems involving general networks.

Date: 1971
References: Add references at CitEc
Citations: View citations in EconPapers (44)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.5.2.212 (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:5:y:1971:i:2:p:212-221

Access Statistics for this article

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