On the flow cost lowering problem

DOI10.1016/S0377-2217(01)00208-9zbMATH Open0998.90069MaRDI QIDQ1600835FDOQ1600835

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)

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

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)

Cites Work

• Network flows. Theory, algorithms, and applications.
• Title not available (Why is that?)
• The Recognition of Series Parallel Digraphs
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (10)

• The \(p\)-median problem with upgrading of transportation costs and minimum travel time allocation
• Budget-constrained minimum cost flows
• 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
• Title not available (Why is that?)
• 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)