On the complexity of the dual method for maximum balanced flows

DOI10.1016/0166-218X(94)90164-3zbMath0810.90035OpenAlexW2111182278MaRDI QIDQ1324690

Uwe T. Zimmermann

Publication date: 2 April 1995

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(94)90164-3

zbMATH Keywords

balanced submodular flowsrational or integral flow values

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items (1)

On multiroute maximum flows in networks

Uses Software

• NETGEN

Cites Work

• Unnamed Item
• Unnamed Item
• Duality for balanced submodular flows
• The Computational Complexity of Simultaneous Diophantine Approximation Problems
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems

This page was built for publication: On the complexity of the dual method for maximum balanced flows