Calculating Maximal Flows in a Network with Positive Gains

DOI10.1287/opre.21.2.528zbMath0304.90043OpenAlexW2132452224MaRDI QIDQ4060687

R. C. Grinold

Publication date: 1973

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.21.2.528

Mathematics Subject Classification ID

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

Related Items (7)

A decomposition algorithm to determine the maximum flow in a generalized network ⋮ On the relation of max-flow to min-cut for generalized networks ⋮ Parametric maximal flows in generalized networks – complexity and algorithms ⋮ A simple GAP-canceling algorithm for the generalized maximum flow problem ⋮ Maximum outflow in generalized flow networks ⋮ A parametric algorithm for convex cost network flow and related problems ⋮ Network flows with age dependent decay rates

This page was built for publication: Calculating Maximal Flows in a Network with Positive Gains