Speeding Up the Estimation of Expected Maximum Flows Through Reliable Networks
Published By: IIM-A on eSS | Published Date: April, 23 , 2009In 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]
Author(s): Megha Sharma, Diptesh Ghosh | Posted on: Jul 23, 2010 | Views(992) | Download (620)