Algebraic methods for stochastic minimum cut and maximum flow problems

DOI10.1007/978-3-642-21527-8_35MaRDI QIDQ3091514zbMATH OpenOpenAlexFDO

Authors Katherine C. Hastings, Douglas R. Shier

Publication date 9 September 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-21527-8_35

Mathematics Subject Classification ID

Flows in graphs (05C21) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Deterministic network models in operations research (90B10)

Recommendations

• Algebraic methods applied to shortest path and maximum flow problems in stochastic networks
• An algorithm of calculating the reliability of stochastic flow networks by using minimal cuts
• Probabilistic Analysis of Network Flow Algorithms
• Maximum flows in probabilistic networks
• scientific article; zbMATH DE number 742961

Cited in

(3)

• The value of information in stochastic maximum flow problems
• Algebraic methods applied to shortest path and maximum flow problems in stochastic networks
• Two‐stage stochastic minimum s − t cut problems: Formulations, complexity and decomposition algorithms

This page was built for publication: Algebraic methods for stochastic minimum cut and maximum flow problems

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