A note on primal network flow algorithms

DOI10.1007/BF01917660zbMath0397.90040MaRDI QIDQ4181571

No author found.

Publication date: 1978

Published in: Zeitschrift für Operations Research (Search for Journal in Brave)

zbMATH Keywords

Minimum-Cost Flow ProblemsPrimal Network Flow AlgorithmsUnbounded Incremental GraphUpper And Lower Bounds on Arcs

Mathematics Subject Classification ID

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

Cites Work

• Two new algorithms for minimal cost flow problems
• A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on primal network flow algorithms