Basis characterisation for linear multicommodity network programs

References

• Assad , A.A. 1978 . Multicommodity network flows-a survey . Networks , 8 : 37 – 91 .
   Web of Science ®Google Scholar
• Coullard C.R. Ng P.H. Totally unimodular Leontief directed hypergraph Institue for Interdisicplinary Engineering Studies, Purdue University West Lafayette, Indiana 1990 Technical ReportCC-90-27
   Google Scholar
• Dantzig , G.B. 1963 . Linear Programming And Extensions , N.J : Princeton University Press .
   Google Scholar
• Ford , L.R. and Fulkerson , D.R. 1962 . Flows In Networks , N.J : Princeton University Press .
   Google Scholar
• Farvolden , J.M. and Lustig , W.B. 1993 . A primal partitioning solution for the arc-chain formulation of a multicommodity network flow problem . Oper. Res , 41 : 669 – 693 .
   Web of Science ®Google Scholar
• Glover , F. , Hultz , J. and Klingman , D. 1977 . Improved computer-based planning techniques , Austin, Texas : Center For Cybernetic Studies, Texas University . Research Report CCS 283
   Google Scholar
• Hartman , J.K. and Lasdon , L.S. 1972 . A Generalized Upper Bounding Algorithm For Multicommodity Network Flow Problem . Networks , 1 : 333 – 354 .
   Google Scholar
• Kennington , J.L. 1978 . A Survey Of Linear Cost Multicommodity Network Flows . Oper. Res , 26 : 209 – 236 .
   Web of Science ®Google Scholar
• Kennington , J.L. and Helgason , R.V. 1980 . Algorithms For Network Programming , New York : Wiley-Interscience .
   Google Scholar
• Rockafellar , R.T. 1984 . Network Flows And Monotropic Optimization , New York : Wiley-Interscience .
   Google Scholar