论文信息 - The Minimax and Maximin Location Problems on a Network with Uniform Distributed Weights

The Minimax and Maximin Location Problems on a Network with Uniform Distributed Weights

In this paper we consider the weighted minimax and maximin location problems on the network when the weights are drawn from a uniform distribution. In the minimax (maximin) problem with stochastic demand the probability that the maximum (minimum) weighted distance between the facility and demand points exceeding (falling short of) a given value T is minimized. Properties of the solution points for both problems are proven and algorithms are presented.

G. O. Wesolowsky | Z. Drezner | O. Berman | Jiamin Wang

[1] S. L. Hakimi,et al. Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph , 1964 .

[2] H. Frank,et al. Optimum Locations on a Graph with Probabilistic Demands , 1966, Oper. Res..

[3] D. Hearn,et al. The Minimum Covering Sphere Problem , 1972 .

[4] G. O. Wesolowsky. Probabilistic Weights in the One-Dimensional Facility Location Problem , 1977 .

[5] R. Garfinkel,et al. Locating an Obnoxious Facility on a Network , 1978 .

[6] Arie Tamir,et al. Improved Complexity Bounds for Center Location Problems on Networks by Using Dynamic Data Structures , 1988, SIAM J. Discret. Math..

[7] Erhan Erkut,et al. Analytical models for locating undesirable facilities , 1989 .

[8] G. Marcoulides. Applied Location Theory Models , 1998 .

[9] Zvi Drezner,et al. A note on the location of an obnoxious facility on a network , 2000, Eur. J. Oper. Res..