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

被引：3

作者：

Berman, O

Drezner, Z

Wang, RM

Wesolowsky, GO

机构：

[1] Univ Toronto, Joseph L Rotman Sch Management, Toronto, ON M5S 3E6, Canada

[2] Calif State Univ Fullerton, Coll Business & Econ, Fullerton, CA 92834 USA

[3] Long Isl Univ, Dept Management, CW Post, Greenvale, NY 11548 USA

[4] McMaster Univ, Fac Business, Hamilton, ON L8S 4M4, Canada

来源：

IIE TRANSACTIONS | 2003年 / 35卷 / 11期

基金：

加拿大自然科学与工程研究理事会;

关键词：

D O I：

10.1080/07408170304397

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

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.

引用

页码：1017 / 1025

页数：9

共 15 条

[11] OPTIMUM LOCATIONS OF SWITCHING CENTERS + ABSOLUTE CENTERS + MEDIANS OF GRAPH [J].