A measure-theoretical max-flow problem

MaRDI QIDQ5948020zbMATH OpenFDO

Authors Konrad Jacobs

Publication date 6 November 2001

Published in Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)

Full work available at URL http://www.emis.de/journals/SLC/opapers/s11jacobs1.html

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Large-scale problems in mathematical programming (90C06)

Recommendations

• scientific article; zbMATH DE number 1127062
• scientific article; zbMATH DE number 3848938
• A measure-theoretical max-flow-min-cut problem
• scientific article; zbMATH DE number 3908126
• An Approximation for a Continuous Max-Flow Problem
• scientific article; zbMATH DE number 1062936
• Maximum flows on disjoint paths
• Generalization of a theorem on the parametric maximum flow problem
• Maximum flows in probabilistic networks
• A new approach to the maximum-flow problem

Cited in

(8)

• Strong Duality for the Maximum Borel Flow Problem
• scientific article; zbMATH DE number 3848938 (Why is no real title available?)
• scientific article; zbMATH DE number 3908126 (Why is no real title available?)
• scientific article; zbMATH DE number 45022 (Why is no real title available?)
• scientific article; zbMATH DE number 1127062 (Why is no real title available?)
• The Maximum Flow Problem for Oriented Flows
• scientific article; zbMATH DE number 5585920 (Why is no real title available?)
• A measure-theoretical max-flow-min-cut problem

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

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