On the relation of max-flow to min-cut for generalized networks

DOI10.1016/0377-2217(89)90357-3zbMath0675.90030OpenAlexW2113683184MaRDI QIDQ1122471

P. Simin Pulat

Publication date: 1989

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(89)90357-3

zbMATH Keywords

max-flow min-cut theoremmaximum flow algorithmsgeneralized networkarc multipliers

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Cites Work

• Maximum outflow in generalized flow networks
• Calculating Maximal Flows in a Network with Positive Gains
• Unnamed Item

This page was built for publication: On the relation of max-flow to min-cut for generalized networks