An analytic symmetrization of max flow-min cut

DOI10.1016/S0012-365X(96)00199-9zbMath0873.90029OpenAlexW1976888960MaRDI QIDQ1356775

Ting-Yi Sung, Manfred W. Padberg

Publication date: 10 June 1997

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(96)00199-9

zbMATH Keywords

directed networkmax flow-min cut theorem for undirected graphsmaximum capacitated \((s,t)\)-flow problemminimum weighted \((s,t)\)-cut problem

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items (1)

An analytical comparison of different formulations of the travelling salesman problem

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

This page was built for publication: An analytic symmetrization of max flow-min cut