Maximum flows in generalized processing networks

DOI10.1007/S10878-016-0031-YzbMATH Open1406.90121OpenAlexW2406368091MaRDI QIDQ2012883FDOQ2012883

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

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

zbMATH Keywords

algorithmscomplexitymaximum flow problemprocessing networks

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Introduction to algorithms.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Minimum cost flow algorithms for series-parallel networks
• The Recognition of Series Parallel Digraphs
• Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems
• Combinatorial optimization. Theory and algorithms.
• Some further results on minimum distribution cost flow problems
• Manufacturing network flows: a generalized network flow model for manufacturing process modelling
• An efficient generalized network-simplex-based algorithm for manufacturing network flows
• A Primal Simplex Approach to Pure Processing Networks
• A note on a generalized network flow model for manufacturing process
• Title not available (Why is that?)
• Maximum flow problem in the distribution network
• A network simplex algorithm for solving the minimum distribution cost problem
• Title not available (Why is that?)
• An improved primal simplex variant for pure processing networks

Cited In (6)

• A generalized approximation framework for fractional network flow and packing problems
• Generalized Maximum Flows over Time
• New ways in municipal flood mitigation: a mixed-integer programming approach and its practical application
• A fast algorithm for bounded generalized processing networks
• Maximum concurrent flow with incomplete data
• Maximal flow network modelling of production bottleneck problems

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)