Maximum flows in generalized processing networks
From MaRDI portal
Publication:2012883
DOI10.1007/s10878-016-0031-yzbMath1406.90121OpenAlexW2406368091MaRDI QIDQ2012883
Sven O. Krumke, Michael Holzhauser, Clemens Thielen
Publication date: 3 August 2017
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-016-0031-y
Related Items (2)
New ways in municipal flood mitigation: a mixed-integer programming approach and its practical application ⋮ A generalized approximation framework for fractional network flow and packing problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An efficient generalized network-simplex-based algorithm for manufacturing network flows
- A note on a generalized network flow model for manufacturing process
- Minimum cost flow algorithms for series-parallel networks
- A network simplex algorithm for solving the minimum distribution cost problem
- Maximum flow problem in the distribution network
- Some further results on minimum distribution cost flow problems
- Manufacturing network flows: a generalized network flow model for manufacturing process modelling
- A Primal Simplex Approach to Pure Processing Networks
- The Recognition of Series Parallel Digraphs
- An improved primal simplex variant for pure processing networks
- Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems
- Combinatorial optimization. Theory and algorithms.
This page was built for publication: Maximum flows in generalized processing networks
