Probabilistic location problems with discrete demand weights

doi:10.1002/net.20015

Probabilistic location problems with discrete demand weights

2004-05-26

0

PRE

AI

DOI：10.1002/net.20015

原文链接

原文求助

摘要

En 中文

AbstractIn 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

Probabilistic location problems with discrete demand weights

摘要

期刊

机构

引用论文