Optimizing cost flows by edge cost and capacity upgrade

DOI10.1016/j.jda.2004.04.003zbMath1118.90052OpenAlexW2051873362MaRDI QIDQ876725

Hartmut Noltemeier, I. Demgensky, Hans-Christoph Wirth

Publication date: 26 April 2007

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2004.04.003

zbMATH Keywords

transportation problemsminimum cost flownetwork designseries-parallel graphsnetwork upgrade

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Approximation algorithms (68W25)

Related Items

Budget-constrained minimum cost flows ⋮ Robust flows with losses and improvability in evacuation planning ⋮ A linear time algorithm for a variant of the MAX CUT problem in series parallel graphs

Cites Work

• Modifying edges of a network to obtain short subgraphs
• Improving spanning trees by upgrading nodes
• Bicriteria Network Design Problems
• Network upgrading problems
• Many birds with one stone
• The network inhibition problem
• Upgrading bottleneck constrained forests
• Unnamed Item
• Unnamed Item
• Unnamed Item