Maximum flow in probabilistic graphs-the discrete case

DOI10.1002/NET.3230060208MaRDI QIDQ4108116zbMATH OpenOpenAlexFDO

Authors

Publication date 1976

Published in Networks (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Graph theory (05C99) Partial orders, general (06A06) Structure theory of lattices (06B05) Stochastic network models in operations research (90B15) Integer programming (90C10)

Cited in

(9)

• Probabilistic analysis of combinatorial algorithms: A bibliography with selected annotations
• Investments in stochastic maximum flow networks
• Overall-terminal reliability of a stochastic capacitated-flow network.
• Unreliability evaluation for a limited-flow network with failed nodes subject to the budget constraint
• The value of information in stochastic maximum flow problems
• Evaluating Reliability of Stochastic Flow Networks
• Fast augmentation algorithms for maximising the output flow in repairable flow networks after edge failures
• Algebraic methods applied to shortest path and maximum flow problems in stochastic networks
• Two-commodity reliability evaluation of a stochastic-flow network with varying capacity weight in terms of minimal paths

This page was built for publication: Maximum flow in probabilistic graphs-the discrete case

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