对《最大多商品网络流的一种建议算法》的评论

Comments on “A Suggested Computation for Maximal Multi-Commodity Network Flows”

Management Science · 2004
被引 0
人大 A+FT50UTD24ABS 4*

中文导读

评论了Ford和Fulkerson 1958年关于多商品网络流的开创性论文,该文提出了多商品共享容量网络的概念,对管理科学的应用和理论发展有重要影响。

Abstract

T L. R. Ford Jr. and D. R. Fulkerson paper, “Suggested Computation for Maximal MultiCommodity Network Flows” (Management Science 1958), is a foundation study for two important developments in the management sciences. One is applied and the other is theoretical. The basic theory for single-commodity network flows was developed primarily by Ford, Fulkerson, and Dantzig and documented in a series of publications in the late 1950s and two famous books (Flows in Networks by Ford and Fulkerson and Linear Programming and Extensions by Dantzig). This Management Science 1958 manuscript introduced the concept of multiple commodities sharing the same capacitated network. In the introduction they state the major differences between the multicommodity version and its single-commodity cousin.

最大多商品网络流网络流理论多商品流容量约束网络