On the complexity of the dual method for maximum balanced flows

DOI10.1016/0166-218X(94)90164-3zbMATH Open0810.90035OpenAlexW2111182278MaRDI QIDQ1324690FDOQ1324690

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
• The Computational Complexity of Simultaneous Diophantine Approximation Problems
• Duality for balanced submodular flows

Cited In (7)

• On multiroute maximum flows in networks.
• Title not available (Why is that?)
• The balance problem of min-max systems is co-nNP hard
• NP-COMPLETENESS AND APPROXIMATION ALGORITHM FOR THE MAXIMUM INTEGRAL VERTEX-BALANCED FLOW PROBLEM
• TWO EFFICIENT ALGORITHMS FOR THE GENERALIZED MAXIMUM BALANCED FLOW PROBLEM
• On dual minimum cost flow algorithms
• On the equivalence of the maximum balanced flow problem and the weighted minimax flow problem

Uses Software

• NETGEN

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

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