Speeding Up the Estimation of Expected Maximum Flows Through Reliable Networks
In this paper we present a strategy for speeding up the estimation of expected maximum flows through reliable networks. Our strategy tries to minimize the repetition of computational effort while evaluating network states sampled using the crude Monte Carlo method. Computational experiments with this strategy on three types of randomly generated networks show that it reduces the number of flow augmentations required for evaluating the states in the sample by as much as 52% on average with a standard deviation of 7% compared to the conventional strategy. This leads to an average time saving of about 71% with a standard deviation of about 8%. [W.P. No. 2009-04-05]
When requesting a correction, please mention this item's handle: RePEc:ess:wpaper:id:2698. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Padma Prakash)
If references are entirely missing, you can add them using this form.