Paper Info
Title
The beta-reliable minimax and maximin location problems on a network with probabilistic weights
Abstract
We study the beta-reliable minimax and maximin location problems on a network when the weights associated with the nodal points are random variables. In the beta-reliable minimax (maximin) problem, we locate a single facility so as to minimize (maximize) the upper (lower) bound on the maximum (minimum) weighted distance from the nodes to the facility with a probability greater than or equal to a pre-specified level beta. It is shown that under some conditions the two probabilistic models are equivalent to their deterministic counterparts. Solution procedures are developed to solve the problems with weights of continuous and discrete probability distributions. (C) 2009 Wiley Periodicals, Inc. NETWORKS, Vol. 55(2), 99-107 2010
Year
DOI
Venue
2010
10.1002/net.20320
NETWORKS
Keywords
DocType
Volume
facility location,network,center,minimax,maximin
Journal
55
Issue
ISSN
Citations 
2
0028-3045
0
PageRank 
References 
Authors
0.34
0
1
Name
Order
Citations
PageRank
Jiamin Wang1475.91