On the flow cost lowering problem

DOI10.1016/S0377-2217(01)00208-9MaRDI QIDQ1600835zbMATH OpenFDO

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

Publication date 16 June 2002

Published in European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

minimum cost flowseries-parallel graphbudget constrained upgrade problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Recommendations

• Minimum cost flows with minimum quantities
• Optimizing cost flows by edge cost and capacity upgrade
• scientific article; zbMATH DE number 1696527
• The minimal average cost flow problem
• scientific article; zbMATH DE number 1859293

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?)
• Network flows. Theory, algorithms, and applications.
• The Recognition of Series Parallel Digraphs

Cited in

(10)

• Budget-constrained minimum cost flows
• The \(p\)-median problem with upgrading of transportation costs and minimum travel time allocation
• Erratum to ``Minimum cost flows with minimum quantities
• Optimizing cost flows by edge cost and capacity upgrade
• Upgrading edges in the maximal covering location problem
• Minimum cost flows with minimum quantities
• Upgrading edges in the graphical TSP
• scientific article; zbMATH DE number 1696527 (Why is no real title available?)
• On budget-constrained flow improvement.
• On the complexity of the upgrading version of the maximal covering location problem

This page was built for publication: On the flow cost lowering problem

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