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

DOI10.1007/BF01582067zbMath0806.90040OpenAlexW2128695783MaRDI QIDQ1322557

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)

Related Items (3)

A spatially continuous max-flow and min-cut framework for binary labeling problems ⋮ Maximum Flows and Minimum Cuts in the Plane ⋮ Maximum flows and minimum cuts in the plane

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A measure-theoretical max-flow-min-cut problem
• Dual spaces of stresses and strains, with applications to Hencky plasticity
• Convex analysis and measurable multifunctions
• Network flow, transportation and scheduling. Theory and algorithms
• Max-flow min-cut theorem in an anisotropic network
• Maximal flow through a domain
• Continuum approximation to dense networks and its application to the analysis of urban road networks
• A Class of Continuous Network Flow Problems
• Minimax Theorems

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