A note on weighted minimal cost flows

DOI10.1007/BF01917342zbMath0448.90015MaRDI QIDQ3895198

Helmut Friesdorf, Horst W. Hamacher

Publication date: 1981

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

zbMATH Keywords

network flow problemsminimal ratio problemnegative circuit algorithmshortest augmenting circuit algorithmweighted minimal cost flows

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Deterministic network models in operations research (90B10)

Related Items (1)

Decomposition of group flows in regular matroids

Cites Work

• Unnamed Item
• Weighted min cost flows
• A characterization of the minimum cycle mean in a digraph
• Minimal ratio spanning trees

This page was built for publication: A note on weighted minimal cost flows