Speeding Up the Estimation of Expected Maximum Flows Through Reliable Networks

Diptesh Ghosh Megha Sharma

No 2009-04-05, IIMA Working Papers from Indian Institute of Management Ahmedabad, Research and Publication Department

Abstract: 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%.

New Economics Papers: this item is included in nep-cmp
Date: 2009-04-28
View list of references

Downloads: (external link)
http://www.iimahd.ernet.in/publications/data/2009-04-05Sharma.pdf English Version (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: http://EconPapers.repec.org/RePEc:iim:iimawp:2009-04-05

Access Statistics for this paper

More papers in IIMA Working Papers from Indian Institute of Management Ahmedabad, Research and Publication Department
Contact information at EDIRC.
Series data maintained by ().