The β-Reliable Median on a Network with Discrete Probabilistic Demand Weights

Published Online:https://doi.org/10.1287/opre.1070.0422

References

  • Berman O., Wang J. Probabilistic location problems with discrete demand weights. Networks (2004) 44:47–57CrossrefGoogle Scholar
  • Berman O., Wang J. The 1-median and 1-antimedian problems with continuous probabilistic demand weights. INFOR (2006) 44:267–283Google Scholar
  • Berman O., Wang J. The 1-minimax and 1-maximin problems with demand weights of general probability distributions. Networks (2007) 50:127–135CrossrefGoogle Scholar
  • Berman O., Drezner Z., Wang J., Wesolowsky G. O. The minimax and maximin location problems on a network with uniform distributed weights. IIE Trans. (2003a) 35:1017–1025CrossrefGoogle Scholar
  • Berman O., Wang J., Drezner Z., Wesolowsky G. O. A probabilistic minimax location problem on the plane. Ann. Oper. Res. (2003b) 122:59–70CrossrefGoogle Scholar
  • Frank H. Optimum locations on a graph with probabilistic demands. Oper. Res. (1966) 14:409–421LinkGoogle Scholar
  • Frank H. Optimum locations on graphs with correlated normal demands. Oper. Res. (1967) 15:552–557LinkGoogle Scholar
  • Garey M. R., Johnson D. S.Computers and Intractability: A Guide to the Theory of NP-Completeness (1979) (W. H. Freeman, New York) Google Scholar
  • Hakimi S. L. Optimal locations of switching centers and the absolute centers and medians of a graph. Oper. Res. (1964) 12:450–459LinkGoogle Scholar
  • Hakimi S. L. Optimum distribution of switching centers in a communication network and some related graph theoretic problems. Oper. Res. (1965) 13:462–475LinkGoogle Scholar
  • Miller A. C., Rice T. R. Discrete approximations of probability distributions. Management Sci. (1983) 29:352–362LinkGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.