Maximum outflow in generalized flow networks

DOI10.1016/0377-2217(89)90410-4zbMath0691.90022OpenAlexW2131469089MaRDI QIDQ583080

P. Simin Pulat

Publication date: 1989

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(89)90410-4

zbMATH Keywords

generalized flow network

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Related Items (2)

On the relation of max-flow to min-cut for generalized networks ⋮ Reliability assessment of a multistate freight network for perishable merchandise with multiple suppliers and buyers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• a generalized network flow model with application to power supply-demand problems
• A New Polynomially Bounded Shortest Path Algorithm
• Optimal Multi-Level Lot Sizing for Requirements Planning Systems
• Calculating Maximal Flows in a Network with Positive Gains
• On Max Flows with Gains and Pure Min-Cost Flows
• On the Generalized Transportation Problem
• The Generalized Stepping Stone Method for the Machine Loading Model
• The Dual Method for the Generalized Transportation Problem
• Maximal Flow with Gains through a Special Network

This page was built for publication: Maximum outflow in generalized flow networks