On the flow cost lowering problem

DOI10.1016/S0377-2217(01)00208-9zbMath0998.90069MaRDI QIDQ1600835

I. Demgensky, Hartmut Noltemeier, Hans-Christoph 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)

Related Items (6)

Budget-constrained minimum cost flows ⋮ Upgrading edges in the maximal covering location problem ⋮ Upgrading edges in the graphical TSP ⋮ The \(p\)-median problem with upgrading of transportation costs and minimum travel time allocation ⋮ Minimum cost flows with minimum quantities ⋮ Erratum to ``Minimum cost flows with minimum quantities

Cites Work

• The Recognition of Series Parallel Digraphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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