An analytic symmetrization of max flow-min cut
From MaRDI portal
Publication:1356775
DOI10.1016/S0012-365X(96)00199-9zbMath0873.90029MaRDI QIDQ1356775
Manfred W. Padberg, Ting-Yi Sung
Publication date: 10 June 1997
Published in: Discrete Mathematics (Search for Journal in Brave)
directed network; max flow-min cut theorem for undirected graphs; maximum capacitated \((s,t)\)-flow problem; minimum weighted \((s,t)\)-cut problem
90B10: Deterministic network models in operations research
Related Items
Cites Work
- The perfectly matchable subgraph polytope of an arbitrary graph
- An analytical comparison of different formulations of the travelling salesman problem
- Linear optimization and extensions
- The perfectly matchable subgraph polytope of a bipartite graph
- Maximal Flow Through a Network
- On the width—length inequality
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item