论文信息 - The labeling method on two-dimensional networks

The labeling method on two-dimensional networks

— The Ford-Fulkerson labeling method has been extended, for solving the max-flow problem on two-dimensional networks, Le* on networks with directed arcs on a cartesian plane R. Computationally, the algorithm has a good efficiency for networks with at least one node ofdegree < 3 or with some symmetries.

B. Gabutti | A. Ostanello-Borreani | B. Gabutti | A. Ostanello-Borreani

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

[2] A. Charnes,et al. Management Models and Industrial Applications of Linear Programming , 1961 .

[3] D. Koopman,et al. On linear programming and plastic limit analysis , 1965 .

[4] H. J. Greenberg,et al. Linear programming and plastic limit analysis of structures , 1957 .

[5] A. Ghouila-Houri,et al. Programmes, jeux et réseaux de transport , 1963 .

[6] William Prager. Mathematical Programming and Theory of Structures , 1965 .

[7] E. Johnsen. A. Charnes and W. W. Cooper: Management Models and Industrial Applications of linear Programming, Vol. I. and Vol. II, ialt 859 sider. John Wiley and Sons, Inc. London 1961. lait 183 sh/-. , 1962 .