论文信息 - Minimum-Cost Multicommodity Network Flows

Minimum-Cost Multicommodity Network Flows

The minimum-cost multicommodity network flow problem is formulated in both node-arc and arc-chain form, leading to very large linear programs. The special structure of these programs is utilized in algorithms for their solution.

J. A. Tomlin | J. Tomlin

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

[2] G. Dantzig,et al. THE DECOMPOSITION ALGORITHM FOR LINEAR PROGRAMS , 1961 .

[3] T. C. Hu. Multi-Commodity Network Flows , 1963 .

[4] T. C. Hu,et al. Synthesis of a Communication Network , 1964 .

[5] Niels O Jorgensen,et al. Some aspects of the urban traffic assignment problem , 1963 .