Maximum flows in generalized processing networks
type: Item
instance of: scholarly article
title: Maximum flows in generalized processing networks
zbMATH Open document ID: 1406.90121
author: Michael Holzhauser
author: Sven O. Krumke
author: Clemens Thielen
published in: Journal of Combinatorial Optimization
publication date: 2017-08-03T00:00:00Z
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 6756019
zbMATH Keywords: algorithms
zbMATH Keywords: complexity
zbMATH Keywords: maximum flow problem
zbMATH Keywords: processing networks
MaRDI profile type: MaRDI publication profile
full work available at URL: s10878-016-0031-y
OpenAlex ID: W2406368091
cites work: Q3056948
cites work: Minimum cost flow algorithms for series-parallel networks
cites work: An improved primal simplex variant for pure processing networks
cites work: A Primal Simplex Approach to Pure Processing Networks
cites work: Q3651735
cites work: Manufacturing network flows: a generalized network flow model for manufacturing process modelling
cites work: Q4198056
cites work: Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems
cites work: Q4821303
cites work: Q3922456
cites work: Q3342177
cites work: Combinatorial optimization. Theory and algorithms.
cites work: Some further results on minimum distribution cost flow problems
cites work: A note on a generalized network flow model for manufacturing process
cites work: Q4221106
cites work: Maximum flow problem in the distribution network
cites work: The Recognition of Series Parallel Digraphs
cites work: An efficient generalized network-simplex-based algorithm for manufacturing network flows
cites work: A network simplex algorithm for solving the minimum distribution cost problem
DOI: 10.1007/S10878-016-0031-Y
description: scientific article; zbMATH DE number 6756019