A decomposition algorithm to determine the maximum flow in a generalized network

DOI10.1016/0305-0548(89)90017-8zbMath0674.90023OpenAlexW2161863826MaRDI QIDQ1121762

P. Simin Pulat

Publication date: 1989

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(89)90017-8

zbMATH Keywords

decompositionsubnetworksGeneralized networkspositive arc multipliers

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10)

Related Items (1)

Deciding probabilistic automata weak bisimulation: theory and practice

Cites Work

• Solving Generalized Networks
• Calculating Maximal Flows in a Network with Positive Gains
• Maximal Flow with Gains through a Special Network
• Unnamed Item
• Unnamed Item

This page was built for publication: A decomposition algorithm to determine the maximum flow in a generalized network