Examples of max-flow and min-cut problems with duality gaps in continuous networks
type: Item
instance of: scholarly article
title: Examples of max-flow and min-cut problems with duality gaps in continuous networks
zbMATH Open document ID: 0806.90040
DOI: 10.1007/BF01582067
author: Ryôhei Nozawa
published in: Mathematical Programming. Series A. Series B
publication date: 1995-02-21T00:00:00Z
Mathematics Subject Classification ID: 90B10
zbMATH DE Number: 563261
zbMATH Keywords: duality gap
zbMATH Keywords: max-flow min-cut theorem
MaRDI profile type: Publication
cites work: Q3770273
cites work: A measure-theoretical max-flow-min-cut problem
cites work: Convex analysis and measurable multifunctions
cites work: Minimax Theorems
cites work: Q3292914
cites work: Q3334514
cites work: Q5595961
cites work: Network flow, transportation and scheduling. Theory and algorithms
cites work: Q3673434
cites work: Dual spaces of stresses and strains, with applications to Hencky plasticity
cites work: Max-flow min-cut theorem in an anisotropic network
cites work: A Class of Continuous Network Flow Problems
cites work: Maximal flow through a domain
cites work: Continuum approximation to dense networks and its application to the analysis of urban road networks
full work available at URL: https://doi.org/10.1007/bf01582067
OpenAlex ID: W2128695783
description: scientific article; zbMATH DE number 563261