Optimizing cost flows by edge cost and capacity upgrade

DOI10.1016/J.JDA.2004.04.003MaRDI QIDQ876725zbMATH OpenOpenAlexFDO

Authors I. Demgensky, Hartmut Noltemeier, H.-C. 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

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)

Recommendations

• scientific article; zbMATH DE number 1859293
• scientific article; zbMATH DE number 1696527
• scientific article; zbMATH DE number 1163718
• On budget-constrained flow improvement.
• On the flow cost lowering problem

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1256748 (Why is no real title available?)
• scientific article; zbMATH DE number 1487883 (Why is no real title available?)
• Improving spanning trees by upgrading nodes
• Many birds with one stone
• Modifying edges of a network to obtain short subgraphs
• Network upgrading problems
• The network inhibition problem
• Upgrading bottleneck constrained forests

Cited in

(8)

• Budget-constrained minimum cost flows
• scientific article; zbMATH DE number 1859293 (Why is no real title available?)
• 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
• scientific article; zbMATH DE number 1696527 (Why is no real title available?)
• The budgeted minimum cost flow problem with unit upgrading cost
• On budget-constrained flow improvement.

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)