Optimizing cost flows by edge cost and capacity upgrade

DOI10.1016/J.JDA.2004.04.003zbMATH Open1118.90052OpenAlexW2051873362MaRDI QIDQ876725FDOQ876725

Hartmut Noltemeier, H.-C. Wirth, I. Demgensky

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

network designminimum cost flowseries-parallel graphstransportation problemsnetwork upgrade

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Bicriteria Network Design Problems
• Network upgrading problems
• Many birds with one stone
• The network inhibition problem
• Modifying edges of a network to obtain short subgraphs
• Improving spanning trees by upgrading nodes
• Upgrading bottleneck constrained forests

Cited In (6)

• Budget-constrained minimum cost flows
• Title not available (Why is that?)
• A linear time algorithm for a variant of the MAX CUT problem in series parallel graphs
• On the flow cost lowering problem
• Robust flows with losses and improvability in evacuation planning
• Title not available (Why is that?)

   Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• On budget-constrained flow improvement. 👍 👎
• On the flow cost lowering problem 👍 👎

This page was built for publication: Optimizing cost flows by edge cost and capacity upgrade

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