论文信息 - MULTICOMMODITY SUPPLY AND TRANSPORTATION NETWORKS WITH RESOURCE CONSTRAINTS: THE GENERALIZED MULTICOMMODITY FLOW PROBLEM

MULTICOMMODITY SUPPLY AND TRANSPORTATION NETWORKS WITH RESOURCE CONSTRAINTS: THE GENERALIZED MULTICOMMODITY FLOW PROBLEM

Abstract : The paper presents a method for treating multicommodity network flows in which limited resources are shared among several arcs instead of only one. The study extends the previous solution methods for networks with individual arc capacity constraints to cover joint constraints. This formulation can handle one or more joint capacity constraints in a multicommodity network; with some adjustment in the objective function, it can maximize a linear combination of commodity flows and find a feasible routing to meet flow requirements.

Richard D Wollmer | R. Wollmer

[1] T. C. Hu. Revised Matrix Algorithms for Shortest Paths , 1967 .

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

[3] J. A. Tomlin,et al. Minimum-Cost Multicommodity Network Flows , 1966, Oper. Res..

[4] Robert B. Fetter,et al. A MODEL FOR THE DESIGN AND EVALUATION OF AIR CARGO SYSTEMS , 1966 .

[5] Richard D. Wollmer,et al. Some Methods for Determining the Most Vital Link in a Railway Network , 1963 .

[6] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

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

[8] George B. Dantzig,et al. The Problem of Routing Aircraft--A Mathematical Solution. , 1954 .

[9] J. L. Midler,et al. A FLIGHT PLANNING MODEL FOR THE MILITARY AIRLIFT COMMAND , 1968 .

[10] William S Jewell. A Primal-Dual Multi-Commodity Flow Algorithm , 1966 .