Minimum cost flows with minimum quantities

DOI10.1016/J.IPL.2011.03.007MaRDI QIDQ1944944zbMATH OpenOpenAlexFDO

Authors 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 algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Complexity and approximability of the maximum flow problem with minimum quantities
• On the flow cost lowering problem
• Budget-constrained minimum cost flows
• Erratum to ``Minimum cost flows with minimum quantities
• Minimum cost flow algorithms for series-parallel networks

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Minimal-cost network flow problems with variable lower bounds on arc flows
• Network flow optimization with minimum quantities
• Network flows. Theory, algorithms, and applications.
• On the flow cost lowering problem
• The Recognition of Series Parallel Digraphs

Cited in

(19)

• The generalized assignment problem with minimum quantities
• On the Complexity of Computing Maximum and Minimum Min‐Cost‐Flows
• Complexity and approximability of the maximum flow problem with minimum quantities
• Minimal-cost network flow problems with variable lower bounds on arc flows
• Budget-constrained minimum cost flows
• Erratum to ``Minimum cost flows with minimum quantities
• Network flow optimization with minimum quantities
• Robust transshipment problem under consistent flow constraints
• On the flow cost lowering problem
• Capacity-preserving subgraphs of directed flow networks
• Minimum cost flow problem with conflicts
• A distribution network design problem in the automotive industry: MIP formulation and heuristics
• On minimum reload cost cycle cover
• Minimum transactions problem
• Facets of the stochastic network flow problem
• Robust two-stage combinatorial optimization problems under discrete demand uncertainties and consistent selection constraints
• Robust minimum cost flow problem under consistent flow constraints
• Minimum cost multi-product flow lines
• Solving the undirected minimum cost flow problem with arbitrary costs

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

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