An analytic symmetrization of max flow-min cut
type: Item
instance of: scholarly article
title: An analytic symmetrization of max flow-min cut
zbMATH Open document ID: 0873.90029
DOI: 10.1016/S0012-365X(96)00199-9
author: Ting-Yi Sung
author: Manfred Padberg
published in: Discrete Mathematics
publication date: 1997-06-10T00:00:00Z
Mathematics Subject Classification ID: 90B10
zbMATH DE Number: 1019121
zbMATH Keywords: maximum capacitated \((s,t)\)-flow problem
zbMATH Keywords: minimum weighted \((s,t)\)-cut problem
zbMATH Keywords: directed network
zbMATH Keywords: max flow-min cut theorem for undirected graphs
MaRDI profile type: Publication
cites work: The perfectly matchable subgraph polytope of a bipartite graph
cites work: The perfectly matchable subgraph polytope of an arbitrary graph
cites work: Q3844775
cites work: Maximal Flow Through a Network
cites work: Q5514188
cites work: Q5620998
cites work: Q4082546
cites work: Q3048571
cites work: On the width—length inequality
cites work: Linear optimization and extensions
cites work: An analytical comparison of different formulations of the travelling salesman problem
full work available at URL: s0012-365x(96)00199-9
OpenAlex ID: W1976888960
description: scientific article; zbMATH DE number 1019121