Calculating Maximal Flows in a Network with Positive Gains

DOI10.1287/OPRE.21.2.528MaRDI QIDQ4060687zbMATH OpenOpenAlexFDO

Authors 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

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

Cited in

(7)

• Network flows with age dependent decay rates
• 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
• Maximum outflow in generalized flow networks
• A simple GAP-canceling algorithm for the generalized maximum flow problem
• A parametric algorithm for convex cost network flow and related problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4060687)