On the Maximum Expected Flow in a Network
N. G. F. Sancho · Journal of the Operational Research Society · 1988
Consider a graph G in which every arc (i, j) has two numbers, ρij and cij, associated with it representing the reliability and capacity of the arc respectively. It is shown that the expected flow is equal to the sum of the expected capacities of the paths from source to sink. An algorithm is described to find the maximum expected flow in the network.