A maximum flow problem with intermediate node requirements
type: Item
instance of: scholarly article
title: A maximum flow problem with intermediate node requirements
zbMATH Open document ID: 0552.90029
DOI: 10.1007/BF02876762
author: S. N. Narahari Pandit
author: B. K. Reddy
published in: Proceedings of the Indian Academy of Sciences. Mathematical Sciences
publication date: 1983-01-01T00:00:00Z
review text: A modified version of the maximum flow problem is considered. Instead of flow conservation constraints at any node, the restriction is that the outflow at a node be equal to the excess of the inflow over the node requirement (and 0 if the requirement exceeds the inflow). In other words, a node absorbs up to its requirement and lets the excess go through. The authors propose a modification of Ford and Fulkerson's algorithm to solve this problem. They introduce pseudo-arcs called priority arcs in the network between the various nodes and the sink and impose on these arcs capacities which are the requirements at the nodes. An example is treated in detail.
Mathematics Subject Classification ID: 90B10
zbMATH DE Number: 3880402
zbMATH Keywords: modified maximum flow problem
zbMATH Keywords: intermediate node
zbMATH Keywords: flow conservation
zbMATH Keywords: pseudo-arcs
zbMATH Keywords: priority arcs
MaRDI profile type: Publication
cites work: Q3292914
cites work: Q5595961
Recommended article: The maximum flow problem in a network with special conditions of flow distribution
Recommended article: Q4635958
Recommended article: The multi-terminal maximum-flow network-interdiction problem
Recommended article: Multi-terminal maximum flows in node-capacitated networks
Recommended article: A new approach to the maximum-flow problem
Recommended article: Approximation algorithm for maximum flow network interdiction problem
Recommended article: The maximum flow problem with disjunctive constraints
Recommended article: Q4013591
Recommended article: The Maximum Flow Problem with Conflict and Forcing Conditions
Recommended article: The Maximum Integer Multiterminal Flow Problem
description: scientific article; zbMATH DE number 3880402