论文信息 - A primal-dual algorithm for solving a maximal flow problem in a class of networks with gains

A primal-dual algorithm for solving a maximal flow problem in a class of networks with gains

In a network with positive gains and without absorbing circuits (directed cycles) the problem of maximizing input flow is considered. A primal-dual algorithm to solve the problem is given. The restricted primal problem has been chosen such that it is a problem which can be transformed - by a scaling procedure - to a maximal flow problem in a pure network.

J. Koene

[1] Fred W. Glover,et al. On the equivalence of some generalized network problems to pure network problems , 1973, Math. Program..

[2] Klaus Truemper,et al. An efficient scaling procedure for gain networks , 1976, Networks.

[3] Ray Wild,et al. Optimization Algorithms for Networks and Graphs , 1980 .

[4] John J. Jarvis,et al. Maximal Flow with Gains through a Special Network , 1972, Oper. Res..

[5] A. V. Karzanov,et al. Determining the maximal flow in a network by the method of preflows , 1974 .

[6] K. Onaga. Dynamic Programming of Optimum Flows in Lossy Communication Nets , 1966 .

[7] K. Onaga. Optimum flows in general communication networks , 1967 .

[8] Richard C. Grinold,et al. Calculating Maximal Flows in a Network with Positive Gains , 1973, Oper. Res..

[9] K. Truemper. On Max Flows with Gains and Pure Min-Cost Flows , 1977 .