The probabilistic 1-maximal covering problem on a network with discrete demand weights

Journal of the Operational Research Society

Volumn 59, Issue 10, 2008, Pages 1398-1405

  Berman, O ^a   Wang, J ^b  

^a UNIVERSITY OF TORONTO   (Canada)

^b LONG ISLAND UNIVERSITY   (United States)

Author keywords

Location; Network; Optimization; Probability

Indexed keywords

APPROXIMATION ALGORITHMS; LOCATION; NETWORKS (CIRCUITS); PROBABILITY;

COMPUTATIONAL EXPERIMENT; COVERING PROBLEMS; DISCRETE RANDOM VARIABLES; EXACT ALGORITHMS; NORMAL APPROXIMATION; OPTIMAL SOLUTIONS; SINGLE FACILITIES; UNCERTAIN DEMAND;

OPTIMIZATION;

EID: 51349134919     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2602466     Document Type: Article

References (14)

1. Berman O (1994). The p maximal cover - p partial center problem on networks. Ear J Opl Res 72: 432-442.
2. Berman O and Wang J (2004). Probabilistic location problems with discrete demand weights. Networks 44: 47-57.
3. Berman O and Wang J (2007). The 1-median and 1-animedian problems with continuous probabilistic demand weights. INFOR, forthcoming.
4. Berman O, Wang J, Drezner Z and Wesolowsky GO (2003a). A probabilistic minimax location problem on the plane. Ann Opns Res 122: 59-70.
5. Berman O, Wang J, Drezner Z and Wesolowsky GO (2003b). The minimax and maximin location problems on a network with uniform distributed weights. IIE Trans 35: 1017-1025.
6. Charms A and Cooper WW (1963). Deterministic equivalents for optimizing and satisfying under chance constraints. Opns Res 11: 18-39.
7. Church RL and Meadows ME (1978). Location modeling utilizing maximum service distance criteria. Geographic Anal 11: 358-373.
8. Church RL and ReVelle C (1974). The maximal covering location problem. Papers Region Sci Assoc 32: 101-118.
9. Frank H (1966). Optimum locations on a graph with probabilistic demands. Opns Res 14: 409-421.
10. Frank H (1967). Optimum locations on a graph with correlated normal demands. Opns Res 15: 552-556.
11. Garay MR and Johnson D (1979). Computers and Intractability: A Guide to the Theory of NP-completeness. W.H. Freeman: New York.
12. Handler GY (1990). p-Center problems. In: Mirchandani PB and Francis RL (cds). Discrete Facility Location 1990. Wiley: New York, pp 305-346.
13. Revelle C and Willimas JC (2002). Reserve design and facility siting. In: Drezner Z and Hamacher HW (eds). Facility Location: Applications and Theory 2002. Springer-Verlag: Berlin, pp 307-328.
14. Simon HA (1957). Models of Man. Wiley: New York, pp 243-273.