IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v14y1966i3p409-421.html
   My bibliography  Save this article

Optimum Locations on a Graph with Probabilistic Demands

Author

Listed:
  • H. Frank

    (University of California, Berkeley, California)

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.

Suggested Citation

  • H. Frank, 1966. "Optimum Locations on a Graph with Probabilistic Demands," Operations Research, INFORMS, vol. 14(3), pages 409-421, June.
    • Handle: RePEc:inm:oropre:v:14:y:1966:i:3:p:409-421
    DOI: 10.1287/opre.14.3.409
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.14.3.409
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.14.3.409?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Igor Averbakh & Oded Berman, 2000. "Minmax Regret Median Location on a Network Under Uncertainty," INFORMS Journal on Computing, INFORMS, vol. 12(2), pages 104-110, May.
    2. Averbakh, Igor & Berman, Oded, 2000. "Algorithms for the robust 1-center problem on a tree," European Journal of Operational Research, Elsevier, vol. 123(2), pages 292-302, June.
    3. Kena Zhao & Tsan Sheng Adam Ng & Xiao Liu, 2020. "A guarantee rate optimization model for wastewater treatment system design under uncertainty," Naval Research Logistics (NRL), John Wiley & Sons, vol. 67(6), pages 420-437, September.
    4. Alan Murray, 2010. "Advances in location modeling: GIS linkages and contributions," Journal of Geographical Systems, Springer, vol. 12(3), pages 335-354, September.
    5. Igor Averbakh, 2005. "The Minmax Relative Regret Median Problem on Networks," INFORMS Journal on Computing, INFORMS, vol. 17(4), pages 451-461, November.
    6. Jiamin Wang, 2007. "The (beta)-Reliable Median on a Network with Discrete Probabilistic Demand Weights," Operations Research, INFORMS, vol. 55(5), pages 966-975, October.
    7. K Sörensen, 2008. "Investigation of practical, robust and flexible decisions for facility location problems using tabu search and simulation," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(5), pages 624-636, May.
    8. Current, John & Ratick, Samuel & ReVelle, Charles, 1998. "Dynamic facility location when the total number of facilities is uncertain: A decision analysis approach," European Journal of Operational Research, Elsevier, vol. 110(3), pages 597-609, November.
    9. George L. Vairaktarakis & Panagiotis Kouvelis, 1999. "Incorporation dynamic aspects and uncertainty in 1‐median location problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(2), pages 147-168, March.
    10. Vladimir Marianov & Daniel Serra, 2009. "Median problems in networks," Economics Working Papers 1151, Department of Economics and Business, Universitat Pompeu Fabra.
    11. O Berman & J Wang, 2008. "The probabilistic 1-maximal covering problem on a network with discrete demand weights," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(10), pages 1398-1405, October.
    12. Berman, Oded & Sanajian, Nima & Wang, Jiamin, 2017. "Location choice and risk attitude of a decision maker," Omega, Elsevier, vol. 66(PA), pages 170-181.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:14:y:1966:i:3:p:409-421. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.