Optimum Locations on a Graph with Probabilistic Demands

H. Frank
Additional contact information
H. Frank: University of California, Berkeley, California

Operations Research, 1966, vol. 14, issue 3, 409-421

Abstract: The traffic demands at the stations of a communication network are usually not deterministic. Optimum locations found using deterministic techniques are poor when the random nature of the network traffic is considered. The concepts of absolute centers and medians are generalized to maximum probability absolute centers and medians. Minimum variance points are also considered. Techniques to locate these optimum points are discussed.

Date: 1966
References: Add references at CitEc
Citations: View citations in EconPapers (13)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.14.3.409 (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:oropre:v:14:y:1966:i:3:p:409-421

Access Statistics for this article

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