Premium
Probabilistic location problems with discrete demand weights
Author(s) -
Berman Oded,
Wang Jiamin
Publication year - 2004
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.20015
Subject(s) - probabilistic logic , mathematical optimization , computer science , mathematics , artificial intelligence
In this article we consider four models for locating a facility on an undirected network with demand weights, which are independent discrete random variables. These problems include the probabilistic versions of two models for locating desirable facilities: the 1‐median and 1‐minimax problems and two problems for locating undesirable facilities: the 1‐antimedian and 1‐maximin problems. The article contains analysis of special cases where a solution is determined by solving deterministic versions of the problems and efficient algorithms to solve the problems in general. © 2004 Wiley Periodicals, Inc. NETWORKS, Vol. 44(1), 47–57 2004