Minimum cost flows with minimum quantities

DOI10.1016/j.ipl.2011.03.007zbMath1260.68297OpenAlexW1966645155MaRDI QIDQ1944944

Sven O. Krumke, Clemens Thielen

Publication date: 28 March 2013

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2011.03.007

zbMATH Keywords

computational complexityminimum cost flowapproximation scheme

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (7)

A distribution network design problem in the automotive industry: MIP formulation and heuristics ⋮ Robust minimum cost flow problem under consistent flow constraints ⋮ Robust transshipment problem under consistent flow constraints ⋮ Robust two-stage combinatorial optimization problems under discrete demand uncertainties and consistent selection constraints ⋮ Erratum to ``Minimum cost flows with minimum quantities ⋮ Complexity and approximability of the maximum flow problem with minimum quantities ⋮ The generalized assignment problem with minimum quantities

Cites Work

• Unnamed Item
• Unnamed Item
• Minimal-cost network flow problems with variable lower bounds on arc flows
• On the flow cost lowering problem
• The Recognition of Series Parallel Digraphs
• Network Flow Optimization with Minimum Quantities

This page was built for publication: Minimum cost flows with minimum quantities