Algebraic Methods for Stochastic Minimum Cut and Maximum Flow Problems

DOI10.1007/978-3-642-21527-8_35zbMath1345.05045OpenAlexW2169433372MaRDI QIDQ3091514

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

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

Related Items (2)

The value of information in stochastic maximum flow problems ⋮ 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