The minimax and maximin location problems on a network with uniform distributed weights

IIE Transactions (Institute of Industrial Engineers)

Volumn 35, Issue 11, 2003, Pages 1017-1025

  Berman, Oded ^a   Drezner, Zvi ^b   Wang, Jiamin ^c   Wesolowsky, George O ^d  

^a UNIVERSITY OF TORONTO   (Canada)

^b CALIFORNIA STATE UNIVERSITY   (United States)

^c LONG ISLAND UNIVERSITY   (United States)

^d MCMASTER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; MATHEMATICAL MODELS; OPTIMIZATION; PROBABILITY DENSITY FUNCTION; PROBABILITY DISTRIBUTIONS; RANDOM PROCESSES;

MAXIMIN LOCATION PROBLEM; MINIMAX LOCATION PROBELM; STOCHASTIC DEMAND;

OPERATIONS RESEARCH;

EID: 4043178505     PISSN: 0740817X     EISSN: 15458830     Source Type: Journal    
DOI: 10.1080/07408170304397     Document Type: Article

References (15)

1. Bazaraa, M.S., Sherali, H.D. and Shetty, C.M. (1993) Non-Linear Programming: Theory and Algorithms, 2nd ed, Wiley, New York, NY
2. Berman, O. and Krass, D. (2002) Facility location with stochastic demands and congestion, in Facility Location: Applications and Theory, Drezner, Z. and Hamacher, H.W (eds.), Springer, Berlin, pp. 329-371.
3. Berman, O. and Wang, J. (2001) The 1-median and 1-antimedian problem with uniform distributed demands. Working paper, Joseph, L. Rotman School of Management, University of Toronto, Toronto, Canada.
4. Berman, O. and Drezner, Z. (2000) A note on the location of an obnoxious facility on a network. European Journal of Operational Research,120, 215-217.
5. Church, R.L. and Garfinkel, R.S. (1978) Locating an obnoxious facility on a network. Transportation Science,12, 107-118.
6. Drezner, Z. and Drezner, T. (1998) Applied location theory models, in Modern Methods for Business Research, Marcoulides, G.A. (ed.), Lawrence Erlbaum Associates, Mahwah, NJ, 79-120.
7. Elzinga, D.J. and Hearn, D.W (1972) The minimum covering sphere problem. Management Science,19, 96-104.
8. Erkut, E. and Neuman, S. (1989) Analytical models for locating undesirable facilities. European Journal of Operational Research,40, 275-291.
9. Frank, H. (1966) Optimum location on a graph with probabilistic demands. Operations Research,14, 409-421.
10. Frank, H. (1967) Optimum location on a graph with correlated normal demands. Operations Research,15, 552-556.
11. Hakimi, S.L. (1964) Optimal location of switching centers and the absolute centers and medians of a graph. Operations Research,13, 462-475.
12. Love, R.F., Morris, J.G. and Wesolowsky, G.O. (1988) Facilities Location: Models and Methods, North Holland, New York, NY.
13. Sylvester, J.J. (1857) A question in the geometry of situation. Quarterly Journal of Pure and Applied Mathematics,1, 79.
14. Tamir, A. (1988) Improved complexity bounds for center location problems on networks by using dynamic data structures. SIAM Journal of Discrete Mathematics,1(3), 377-396.
15. Wesolowsky, G.O. (1977) Probabilistic weights in the one-dimensional facility location problem. Management Science,24, 224-229.