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

DOI10.1007/BF02571255zbMATH Open0691.90023OpenAlexW2011918905MaRDI QIDQ583082FDOQ583082

Authors: Wolfgang Blum 

Publication date: 1990

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

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

Recommendations

• A measure-theoretical max-flow problem
• scientific article; zbMATH DE number 1127062
• scientific article; zbMATH DE number 3848938
• Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
• Approximate max-integral-flow/min-multicut theorems
• scientific article; zbMATH DE number 45022
• The Max-Flow Min-Cut theorem for countable networks
• Max flow and min cut with bounded-length paths: complexity, algorithms, and approximation
• A mechanized proof of the max-flow min-cut theorem for countable networks with applications to probability theory
• A Mechanized Proof of the Max-Flow Min-Cut Theorem for Countable Networks

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Topology and measure
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Class of Continuous Network Flow Problems
• Measure theoretic versions of linear programming
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (21)

• All-maximum and all-minimum problems under some measures
• The max-flow min-cut property and \(\pm 1\)-resistant sets
• Title not available (Why is that?)
• Quantum max-flow/min-cut
• Maximal stream and minimal cutset for first passage percolation through a domain of \(\mathbb{R}^{d}\)
• Maximum flows and minimum cuts in the plane
• Title not available (Why is that?)
• Examples of max-flow and min-cut problems with duality gaps in continuous networks
• A measure-theoretical max-flow problem
• Maximum cuts for a minimum flow
• Maximum flow in fiber-optic networks
• Title not available (Why is that?)
• Title not available (Why is that?)
• Dual Half-Integrality for Uncrossable Cut Cover and Its Application to Maximum Half-Integral Flow
• Maximum flows and minimum cuts in the plane
• A mechanized proof of the max-flow min-cut theorem for countable networks with applications to probability theory
• Title not available (Why is that?)
• Optimal geometric flows via dual programs
• A minimax-measure intersection problem
• The Max-Flow Min-Cut theorem for countable networks
• Title not available (Why is that?)

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

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