References

• Ali , I. , Barnett , D. , Farhangian , K. , Kennington , J. , Patty , B. , Shetty , B. , McCarl , B. and Wang , P. (1984) . Multicommodity network problems: applications and computations . HE Transactions , 16 : 127 – 134 .
   Google Scholar
• Ali , A. , Helgason , R. , Kennington , J. and Lall , H. (1980) . Computational comparison among three multicommodity network flow algorithms . Operations Research , 28 : 23 – 45 .
   Web of Science ®Google Scholar
• Assad , A. A. (1978) . Multicommodity network flows-A surrey . Networks , 8 : 37 – 91 .
   Web of Science ®Google Scholar
• Barnhart , C. (1993) . Dual-ascent methods for large-scale multicommodity flow problems . Naval Research Logistics Quarterly , 40 : 305 – 324 .
   Google Scholar
• Barnhart , C. and Sheffi , Y. (1993) . A network-based primal-dual heuristic for the solution of multicommodity network flow problems . Transportation Science , 27 : 102 – 117 .
   Web of Science ®Google Scholar
• Bellmore , M. G. , Bennington , S. and Lubore , S. (1971) . A multivehicle tanker scheduling problem . Transportation Science , 5 : 36 – 47 .
   Google Scholar
• Benett , J. M. (1966) . An approach to some structured linear programming problem . Operations Research , 14 : 636 – 645 .
   Web of Science ®Google Scholar
• Chen , H. and DeWald , C. G. (1974) . A generalized chain labeling algorithm for solving multicommodity flow problems . Computers and Operations Research , 1 : 437 – 465 .
   Google Scholar
• Clarke , S. and Surkis , J. (1968) . An operations research approach to racial desegregation of school systems . SocioEconomic Planning Science , 1 : 259 – 272 .
   Web of Science ®Google Scholar
• Cremeans , J. E. , Smith , R. A. and Tyndall , G. R. (1970) . Optimal multicommodity network flows with resource allocation . Naval Research Logistics Quarterly , 17 : 269 – 280 .
   Google Scholar
• Farvolden , J. M. , Powell , W. B. and Lustig , I. J. (1993) . A primal partitioning solution for the arc-chain formulation of a multicommodity network flow problem . Operations Research , 41 : 669 – 693 .
   Web of Science ®Google Scholar
• Ford , L. R. and Fulkerson , D. R. (1958) . A suggested computation for maximized multicommodity network flow . Management Science , 5 : 97 – 101 .
   Web of Science ®Google Scholar
• Gautier , A. and Granot , F. (1995) . Forest management: a multicommodity flow formulation and sensitivity analysis . Management Science , 41 : 1654 – 1668 .
   Web of Science ®Google Scholar
• Geoffrion , A. M. (1970) . Primal resource-directive approaches for optimizing nonlinear decomposable systems . Operations Research , 18 : 375 – 403 .
   Web of Science ®Google Scholar
• Geoffrion , A. M. and Graves , G. W. (1974) . Multicommodity distribution system designed by Benders decomposition . Management Science , 20 : 822 – 844 .
   Web of Science ®Google Scholar
• Gomory , R. E. and Hu , T. C. (1964) . Synthesis of a communicar tion network . S[AM Journal , 12 : 348 – 369 .
   Google Scholar
• Gregoriadis , M. D. and White , W. W. (1972) . A partitioning algorithm for the multicommodity network flow problem . Mathematical Programming , 3 : 157 – 177 .
   Google Scholar
• Held , M. , Wolfe , P. and Crowder , H. (1974) . Validation of subgradient optimization . Mathematical Programming , 6 : 62 – 88 .
   Google Scholar
• Jarvis , J. J. (1969) . On the equivalence between the node-arc and arc-chain formulation for the multicommodity maximal flow problem . Naval Research Logistics Quarterly , 15 : 525 – 529 .
   Google Scholar
• Jarvis , J. J. and Martinez , O. M. (1977) . A sensitivity analysis of multicommodity networks flows . Transportation Science , 11 : 299 – 306 .
   Google Scholar
• Kennington , J. L. (1977) . Solving multicommodity transportation problems using a primal partitioning simplex techniques . Naval Research Logistics Quarterly , 24 : 309 – 325 .
   Google Scholar
• Kennington , J. L. (1978) . A survey of linear cost multicommodity network flows . Operations Research , 26 : 209 – 236 .
   Web of Science ®Google Scholar
• Liu , C. M. (1997) . Network dual steepest-edge methods for solving capacitated multicommodity network problems . Computers and Industrial Engineering , 33 : 697 – 700 .
   Web of Science ®Google Scholar
• Panagiotakopoulos , D. (1976) . Multicommodity multi - transformed network flows with an application to residuals management . Management Science , 22 : 874 – 882 .
   Web of Science ®Google Scholar
• Rao , M. R. and Zionts , S. (1968) . Allocation of transportation units to alternative trips . Operations Research , 16 : 52 – 63 .
   Web of Science ®Google Scholar
• Robacker , J. J. (1956) . “ Notes on linear programming: part XXXVII, concerning multicommodity networks ” . In Memo RU1977 , Santa Monica , Calif : the Rand Corporation .
   Google Scholar
• Saviozzi , G. (1986) . Advanced start for the multicommodity network flow problem . Mathematical Programming Study , 26 : 221 – 224 .
   Web of Science ®Google Scholar
• Schultz , G. L. and Meyer , R. R. (1991) . An interior point method for block angular optimization . SIAM Journal of Optimization , 1 : 583 – 602 .
   Web of Science ®Google Scholar
• Swoveland , C. (1973) . A two-stage decomposition algorithm for a generalized multicommodity flow problem . INFER , 11 : 232 – 244 .
   Google Scholar
• Weigel , H. S. and Cremeans , J. E. (1972) . The multicommodity network flow model revised to include vehicle per time period and model constraints . Naval Research Logistics Quarterly , 19 : 77 – 89 .
   Google Scholar
• White , W. W. and Bomberault , A. M. (1968) . A network algorithm for empty freight car allocation . IBM System Journal , 9 : 147 – 169 .
   Google Scholar
• Wollmer , R. D. (1972) . Multicommodity network with resource constraints: the generalized multicommodity flow problem . Networks , 1 : 245 – 263 .
   Google Scholar
• Zangwill , W. I. (1969) . A backlogging model and a multi-echelon model of a dynamic economic lot size production systemA network approach . Management Science , 15 : 506 – 527 .
   Web of Science ®Google Scholar