Overall-Terminal Multi-commodity Reliability of a Stochastic-Flow Network under the Cost Constraint

For a stochastic-flow network composed of components (arcs and nodes) capable of transmitting different types of commodities in which capacity of each component varies with components, this paper presents a simple algorithm for the system reliability problem under the cost constraint in overall-terminal case in which demand for each node pair is given. The computational complexity of the proposed algorithm is also analyzed