论文信息 - Determination the Basic Network Algorithms with Gains - 字舞流文

Determination the Basic Network Algorithms with Gains

Several optimalization algorithms have been proposed for the solution of the basic network flow algorithms, such as the minimal and the multiterminal minimal path of a network having cost (distance) function, maximal flow of a capacitated network.

Péter Földesi | András Bakó | István Szüts | P. Földesi | A. Bakó | István Szüts

[1] Richard Bellman,et al. ON A ROUTING PROBLEM , 1958 .

[2] A. Bakó,et al. On the determination of the shortes path in a network having gains , 1973 .

[3] Stuart E. Dreyfus,et al. An Appraisal of Some Shortest-Path Algorithms , 1969, Oper. Res..

[4] Jin Y. Yen. Technical Note - On Hu's Decomposition Algorithm for Shortest Paths in a Network , 1971, Oper. Res..

[5] Ronald L. Rivest,et al. Introduction to Algorithms , 1990 .

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

[7] Darwin Klingman,et al. A Note on Finding All Shortest Paths , 1974 .

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

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

[10] Stephen Warshall,et al. A Theorem on Boolean Matrices , 1962, JACM.

[11] T. C. Hu. A Decomposition Algorithm for Shortest Paths in a Network , 1968, Oper. Res..

[12] George B. Dantzig,et al. ALL SHORTEST ROUTES IN A GRAPH , 1966 .

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