Maximum flows in probabilistic networks

DOI10.1002/NET.3230210604MaRDI QIDQ3984285zbMATH OpenOpenAlexFDO

Authors Hiroshi Nagamochi, Toshihide Ibaraki

Publication date 27 June 1992

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230210604

zbMATH Keywords

exact valueexpected value of maximum flowlower boundrandom arc failuresreliability of capacitated networks

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Reliability, availability, maintenance, inspection in operations research (90B25)

Recommendations

• On Onaga's upper bound on the mean values of probabilistic maximum flows
• An approach to calculating the probability of retaining the maximal flow
• Bounds on expected performance of networks with links subject to failure
• On the Maximum Expected Flow in a Network
• Overall-terminal reliability of a stochastic capacitated-flow network.

Cited in

(24)

• An approach to calculating the probability of retaining the maximal flow
• The -maximum flow model with uncertain capacities
• Algebraic methods for stochastic minimum cut and maximum flow problems
• scientific article; zbMATH DE number 6501391 (Why is no real title available?)
• Bounds on expected performance of networks with links subject to failure
• The value of information in stochastic maximum flow problems
• Maximum Bipartite Flow in Networks with Adaptive Channel Width
• scientific article; zbMATH DE number 3904300 (Why is no real title available?)
• On the Maximum Expected Flow in a Network
• Investing in arcs in a network to maximize the expected max flow
• Bounds On The Expected Maximal Value Of A Class Of Stochastic Network Problems
• scientific article; zbMATH DE number 4069978 (Why is no real title available?)
• A functional equation for finding the largest expected capacity of a graph
• On Onaga's upper bound on the mean values of probabilistic maximum flows
• scientific article; zbMATH DE number 176498 (Why is no real title available?)
• A LOWER BOUND OF THE EXPECTED MAXIMUM NUMBER OF VERTEX-DISJOINT s-t PATHS ON PROBABILISTIC GRAPHS
• Maximum Entropy Analysis of Flow Networks with Structural Uncertainty (Graph Ensembles)
• Threshold reliability of networks with small failure sets
• Calculating Maximum Entropy Flows in Networks
• Algebraic methods applied to shortest path and maximum flow problems in stochastic networks
• Maximum bipartite flow in networks with adaptive channel width
• The maximum flow in dynamic networks
• A measure-theoretical max-flow problem
• Network reliability: Heading out on the highway

This page was built for publication: Maximum flows in probabilistic networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3984285)