Examples of max-flow and min-cut problems with duality gaps in continuous networks

DOI10.1007/BF01582067MaRDI QIDQ1322557zbMATH OpenOpenAlexFDO

Authors Ryôhei Nozawa

Publication date 21 February 1995

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01582067

zbMATH Keywords

duality gapmax-flow min-cut theorem

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Recommendations

• Max-flow min-cut theorem in an anisotropic network
• A measure-theoretical max-flow-min-cut problem
• A relaxation of min-cut problem in an anisotropic continuous network
• Duality theorems for a continuous analog of Ford-Fulkerson flows in networks

Cites work

• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• scientific article; zbMATH DE number 3868094 (Why is no real title available?)
• scientific article; zbMATH DE number 3827547 (Why is no real title available?)
• scientific article; zbMATH DE number 4029251 (Why is no real title available?)
• scientific article; zbMATH DE number 3314878 (Why is no real title available?)
• A Class of Continuous Network Flow Problems
• A measure-theoretical max-flow-min-cut problem
• Continuum approximation to dense networks and its application to the analysis of urban road networks
• Convex analysis and measurable multifunctions
• Dual spaces of stresses and strains, with applications to Hencky plasticity
• Max-flow min-cut theorem in an anisotropic network
• Maximal flow through a domain
• Minimax Theorems
• Network flow, transportation and scheduling. Theory and algorithms

Cited in

(6)

• A fast Fourier transform based method for computing the effective crack energy of a heterogeneous material on a combinatorially consistent grid
• scientific article; zbMATH DE number 32325 (Why is no real title available?)
• Maximum flows and minimum cuts in the plane
• An Approximation for a Continuous Max-Flow Problem
• A spatially continuous max-flow and min-cut framework for binary labeling problems
• Maximum flows and minimum cuts in the plane

This page was built for publication: Examples of max-flow and min-cut problems with duality gaps in continuous networks

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