Complexity and approximability of the maximum flow problem with minimum quantities

DOI10.1002/net.21502zbMath1338.68119OpenAlexW2071026504WikidataQ57851375 ScholiaQ57851375MaRDI QIDQ2811300

Stephan Westphal, Clemens Thielen

Publication date: 10 June 2016

Published in: Networks (Search for Journal in Brave)

Full work available at URL: http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:hbz:386-kluedo-31819

zbMATH Keywords

computational complexityapproximation algorithmsmaximum flow problemminimum quantities

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Approximation methods and heuristics in mathematical programming (90C59) Dynamic programming (90C39) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Flows in graphs (05C21)

Related Items (2)

Resource loading with time windows ⋮ Unnamed Item

Cites Work

• Erratum to ``Minimum cost flows with minimum quantities
• Minimal-cost network flow problems with variable lower bounds on arc flows
• Minimum cost flows with minimum quantities
• The Recognition of Series Parallel Digraphs
• Unnamed Item

This page was built for publication: Complexity and approximability of the maximum flow problem with minimum quantities