Maximum flow in probabilistic graphs-the discrete case
From MaRDI portal
Publication:4108116
DOI10.1002/net.3230060208zbMath0339.90017OpenAlexW2021042173MaRDI QIDQ4108116
No author found.
Publication date: 1976
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230060208
Partial orders, general (06A06) Integer programming (90C10) Stochastic network models in operations research (90B15) Structure theory of lattices (06B05) Graph theory (05C99)
Related Items
The value of information in stochastic maximum flow problems ⋮ Algebraic methods applied to shortest path and maximum flow problems in stochastic networks ⋮ Overall-terminal reliability of a stochastic capacitated-flow network. ⋮ Probabilistic analysis of combinatorial algorithms: A bibliography with selected annotations ⋮ Investments in stochastic maximum flow networks ⋮ Two-commodity reliability evaluation of a stochastic-flow network with varying capacity weight in terms of minimal paths ⋮ Fast augmentation algorithms for maximising the output flow in repairable flow networks after edge failures ⋮ Unreliability evaluation for a limited-flow network with failed nodes subject to the budget constraint ⋮ Evaluating Reliability of Stochastic Flow Networks
Cites Work
