Modified Pulat’s algorithm for the maximum outflow problem in undirected generalized networks

Abstract

A generalized network is characterized by arc multipliers that specify which portion of the flow entering an arc at its tail node reaches its head node. In this paper, the goal is to maximize the flow excess at the sink in undirected generalized networks. We show that the results of the directed networks are not satised here. We have specically stated and proved the optimality conditions of the problem. We have also designed an algorithm according to Pulat's algorithm and achieved an efficient version.