The (beta)-Reliable Median on a Network with Discrete Probabilistic Demand Weights

Jiamin Wang ()
Additional contact information
Jiamin Wang: College of Management, Long Island University, C. W. Post Campus, Brookville, New York 11548, and Center for Service Operations, School of Economics and Business Administration, Southwest Jiaotong University, Chengdu, China

Operations Research, 2007, vol. 55, issue 5, 966-975

Abstract: This study extends the classical network median problem by considering the stochastic nature of demand. Assuming that the demand weights associated with nodes are independent discrete random variables, we introduce a chance-constrained programming model to define a (beta)-reliable median of the network. It is shown that the (beta)-reliable median problem is NP-hard. Exact solution procedures and a normal approximation algorithm are developed to search for the (beta)-reliable median. Their performance is evaluated by computational experiments.

Keywords: facilities/equipment planning; location; networks/graphs; theory (search for similar items in EconPapers)
Date: 2007
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.1070.0422 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:55:y:2007:i:5:p:966-975

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().