论文信息 - An efficient scaling procedure for gain networks - 字舞流文

An efficient scaling procedure for gain networks

A simple and efficient procedure is presented which scales a network with gains to an equivalent one with positive or unit gains, provided certain necessary and sufficient conditions are satisfied.

Klaus Truemper | K. Truemper

[1] Abraham Charnes,et al. One-Pass Algorithms for Some Generalized Network Problems , 1966, Oper. Res..

[2] Richard M. Karp,et al. Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.

[3] William S. Jewell. New Methods in Mathematical Programming---Optimal Flow Through Networks with Gains , 1962 .

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

[5] George B. Dantzig,et al. Linear programming and extensions , 1965 .

[6] D. R. Fulkerson,et al. Flows in Networks. , 1964 .

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

[8] Edward Minieka. Optimal Flow In A Network With Gains , 1972 .

[9] S. Vajda,et al. Integer Programming and Network Flows , 1970 .

[10] D. R. Fulkerson,et al. An Out-of-Kilter Method for Minimal-Cost Flow Problems , 1960 .

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

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

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