论文信息 - Multi-Terminal Network Flows - 字舞流文

Multi-Terminal Network Flows

T. C. Hu | R. Gomory

[1] T. C. Hu,et al. An Application of Generalized Linear Programming to Network Flows , 1962 .

[2] W. Mayeda. Terminal and Branch Capacity Matrices of a Communication Net , 1960 .

[3] Robert T. Chien,et al. Synthesis of a Communication Net , 1960, IBM J. Res. Dev..

[4] R. Prim. Shortest connection networks and some generalizations , 1957 .

[5] J. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[6] D. R. Fulkerson,et al. Maximal Flow Through a Network , 1956, Canadian Journal of Mathematics.