Maximum flows in generalized processing networks

DOI10.1007/S10878-016-0031-YMaRDI QIDQ2012883zbMATH OpenOpenAlexFDO

Authors Michael Holzhauser, Sven O. Krumke, 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

zbMATH Keywords

algorithmscomplexitymaximum flow problemprocessing networks

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• Convex generalized flows
• Generalized max flow in series-parallel graphs
• New algorithms for generalized network flows
• Fast and simple approximation schemes for generalized flow.
• Faster algorithms for the generalized network flow problem

Cites work

• scientific article; zbMATH DE number 3876888 (Why is no real title available?)
• scientific article; zbMATH DE number 3735525 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1234104 (Why is no real title available?)
• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• A Primal Simplex Approach to Pure Processing Networks
• A network simplex algorithm for solving the minimum distribution cost problem
• A note on a generalized network flow model for manufacturing process
• An efficient generalized network-simplex-based algorithm for manufacturing network flows
• An improved primal simplex variant for pure processing networks
• Combinatorial optimization. Theory and algorithms.
• Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems
• Introduction to algorithms.
• Manufacturing network flows: a generalized network flow model for manufacturing process modelling
• Maximum flow problem in the distribution network
• Minimum cost flow algorithms for series-parallel networks
• Network flows. Theory, algorithms, and applications.
• Some further results on minimum distribution cost flow problems
• The Recognition of Series Parallel Digraphs

Cited in

(7)

• Convex generalized flows
• Maximum concurrent flow with incomplete data
• Maximal flow network modelling of production bottleneck problems
• Generalized Maximum Flows over Time
• 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
• A fast algorithm for bounded generalized processing networks

This page was built for publication: Maximum flows in generalized processing networks

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