Computational Procedures for Location Problems on Stochastic Networks

Mirchandani and Odoni have extended the concept of median location to stochastic networks, that is, networks where the distances (times) on some arcs and/or the demands at some nodes may be discrete random variables. Computational procedures for the solution of such median location problems on stochastic networks are developed; limited testing gave encouraging results.