An Efficient Minimal Cost Flow Algorithm

DOI10.1287/MNSC.19.9.1042zbMATH Open0259.90051OpenAlexW2152135799MaRDI QIDQ5675166FDOQ5675166

Authors G. E. Bennington

Publication date 1973

Published in Management Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/mnsc.19.9.1042

Mathematics Subject Classification ID

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

Cited in

(3)

• Primal transportation and transshipment algorithms
• Weighted min cost flows
• The generalized alternating path algorithm for transportation problems

This page was built for publication: An Efficient Minimal Cost Flow Algorithm

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