A measure-theoretical max-flow-min-cut problem

DOI10.1007/BF02571255zbMath0691.90023OpenAlexW2011918905MaRDI QIDQ583082

Wolfgang Blum

Publication date: 1990

Published in: Mathematische Zeitschrift (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/174187

zbMATH Keywords

rectifiable Jordan curvescontinuous flows in bounded regionsmax-flow-min-cut

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Programming in abstract spaces (90C48) Classical measure theory (28A99)

Related Items (2)

Maximal stream and minimal cutset for first passage percolation through a domain of \(\mathbb{R}^{d}\) ⋮ Examples of max-flow and min-cut problems with duality gaps in continuous networks

Cites Work

• Measure theoretic versions of linear programming
• Topology and measure
• A Class of Continuous Network Flow Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A measure-theoretical max-flow-min-cut problem