Flows in dynamic networks with aggregate arc capacities

DOI10.1016/j.ipl.2006.07.007zbMath1185.68041OpenAlexW2113674253MaRDI QIDQ845886

Vardges Melkonian

Publication date: 29 January 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2006.07.007

zbMATH Keywords

computational complexitylinear programmingNP-completenessnetworks flows

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Linear programming (90C05) Deterministic network models in operations research (90B10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Complexity analysis for maximum flow problems with arc reversals

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey of dynamic network flows
• The Quickest Transshipment Problem
• Dynamic network flows with arc changes

This page was built for publication: Flows in dynamic networks with aggregate arc capacities