Speeding Up the Estimation of Expected Maximum Flows Through Reliable Networks

Megha Sharma and Diptesh Ghosh

Working Papers from eSocialSciences

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%. [W.P. No. 2009-04-05]

Keywords: Network Flows; Reliable Networks; Cold Start; Warm Start; Reliable Network Evaluation Strategy (search for similar items in EconPapers)
Date: 2010-07
New Economics Papers: this item is included in nep-cmp
Note: Institutional Papers
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.esocialsciences.org/Download/repecDownl ... &AId=2698&fref=repec

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: https://EconPapers.repec.org/RePEc:ess:wpaper:id:2698

Access Statistics for this paper

More papers in Working Papers from eSocialSciences
Bibliographic data for series maintained by Padma Prakash ().