References
- BermanOThe p maximal cover—p partial center problem on networksEur J Opl Res19947243244210.1016/0377-2217(94)90321-2
- BermanOWangJProbabilistic location problems with discrete demand weightsNetworks200444475710.1002/net.20015
- Berman O and Wang J (2007). The 1-median and 1-animedian problems with continuous probabilistic demand weights. INFOR, forthcoming..
- BermanOWangJDreznerZWesolowskyGOA probabilistic minimax location problem on the planeAnn Opns Res2003122597010.1023/A:1026134121255
- BermanOWangJDreznerZWesolowskyGOThe minimax and maximin location problems on a network with uniform distributed weightsIIE Trans2003351017102510.1080/07408170304397
- CharnesACooperWWDeterministic equivalents for optimizing and satisfying under chance constraintsOpns Res196311183910.1287/opre.11.1.18
- ChurchRLMeadowsMELocation modeling utilizing maximum service distance criteriaGeographic Anal19781135837310.1111/j.1538-4632.1979.tb00702.x
- ChurchRLReVelleCThe maximal covering location problemPapers Region Sci Assoc19743210111810.1007/BF01942293
- FrankHOptimum locations on a graph with probabilistic demandsOpns Res19661440942110.1287/opre.14.3.409
- FrankHOptimum locations on a graph with correlated normal demandsOpns Res19671555255610.1287/opre.15.3.552
- GareyMRJohnsonDComputers and Intractability: A Guide to the Theory of NP-completeness1979
- HandlerGYp-Center problemsDiscrete Facility Location 19901990305346
- RevelleCWillimasJCReserve design and facility sitingFacility Location: Applications and Theory 20022002307328
- SimonHAModels of Man1957273243