An Approximation for a Continuous Max-Flow Problem

DOI10.1287/MOOR.18.1.98MaRDI QIDQ4697085zbMATH OpenOpenAlexFDO

Authors Wolfgang Blum

Publication date 29 June 1993

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.18.1.98

zbMATH Keywords

Borel-measurecontinuous max-flowcontinuum approximationfinite networksmeasure-theoretic continuous max-flow problem

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Recommendations

• scientific article; zbMATH DE number 3848938
• Discrete Approximations to Continuum Optimal Flow Problems
• Duality theorems for a continuous analog of Ford-Fulkerson flows in networks
• Examples of max-flow and min-cut problems with duality gaps in continuous networks
• Max concurrent flow problem

Cited in

(12)

• A continuous analog of Ford-Fulkerson flows in networks and its application to a problem of Rota
• Complexity and approximability of the maximum flow problem with minimum quantities
• On solving maximum and quickest interval-valued flows over time
• scientific article; zbMATH DE number 3848938 (Why is no real title available?)
• Discrete Approximations to Continuum Optimal Flow Problems
• scientific article; zbMATH DE number 3908126 (Why is no real title available?)
• scientific article; zbMATH DE number 176498 (Why is no real title available?)
• scientific article; zbMATH DE number 611144 (Why is no real title available?)
• scientific article; zbMATH DE number 1377930 (Why is no real title available?)
• Convergent network approximation for the continuous Euclidean length constrained minimum cost path problem
• SOFSEM 2004: Theory and Practice of Computer Science
• A measure-theoretical max-flow problem

This page was built for publication: An Approximation for a Continuous Max-Flow Problem

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