Free Access
RAIRO-Oper. Res.
Volume 21, Number 3, 1987
Page(s) 205 - 217
Published online 06 February 2017
  • 1. R. K. AHUJA, J. L. BATRA et S. K. GUPTA, A Parametric Algorithm for Convex Cost Network Flow and Related Problems, E.J.O.R., vol. 16, 1984, p. 222-235. [MR: 741402] [Zbl: 0532.90034] [Google Scholar]
  • 2. A. I. ALI, R. V. HELGASON, J. L. KENNINGTON et H. S. HALL, Primal Simplex Network Codes : State-of-the-Art Implementation Technology, Network, vol. 8, 1978, p. 315-339. [MR: 514466] [Google Scholar]
  • 3. R. BARR, F. GLOVER et D. KLINGMAN, Enhancement of Spanning Tree Labelling Procedures for Network Optimization, I.N.F.O.R., vol. 17, 1979, p. 16-34. [Zbl: 0403.90083] [Google Scholar]
  • 4. G. H. BRADLEY, G. G. BROWN et G. W. GRAVES, Design and Implementation of Large Scale Primal Transhipment Algorithms, Management Sciences, vol. 24, 1977, p. 1-34. [Zbl: 0373.90079] [Google Scholar]
  • 5. W. H. CUNNINGHAM, A Network Simplex Method, Mathematical Programming, vol. 11, 1976, p. 105-110. [MR: 462532] [Zbl: 0352.90039] [Google Scholar]
  • 6. G. M. FAIR et J. C. GEYER, Water Supply and Waste Water Disposal, Wiley, New York, 1954. [Google Scholar]
  • 7. L. R. FORD et D. R. FULKERSON, Flows in Networks, Princeton, New Jersey, 1962. [Zbl: 1216.05047] [Google Scholar]
  • 8. F. GLOVER, D. KARNEY et D. KLINGMAN, Implementation and Computational Comparisons of Primal, Dual and Primal-Dual Computer Codes for Minimum Cost Network Flow Problem, Network, vol. 4, 1974, p. 191-210. [Zbl: 0282.68020] [Google Scholar]
  • 9.P. L. HAMMER et M. SEGAL, Area Transfers in Local Area (unpublished work). [Google Scholar]
  • 10. E. HOBSON, D. L. FLETCHER et W. O. STADLIN, Network Flow Linear Programming Techniques and their Application to Fuel Scheduling and Contingency Analysis, I.E.E.E. PAS-103, 1984, p. 1684-1691. [Google Scholar]
  • 11. T. C. Hu, Minimum Cost Flow in Convex Cost Network, Naval Res. Logist. Quart, vol. 13, 1966, p. 1-8. [Google Scholar]
  • 12. P. A. JENSEN et J. W. BARNES, Network Flow Programming, Wiley, New York, 1980. [MR: 579183] [Zbl: 0502.90057] [Google Scholar]
  • 13. J. L. KENNINGTON et R. V. HELGASON, Algorithms for Network Programming, Wiley, New York, 1980. [MR: 581251] [Zbl: 0502.90056] [Google Scholar]
  • 14. D. KLINGMAN, A. NAPIER et J. STUTZ, NETGEN: a Program for Generating Large Scale Capacited Assignment, Transportation and Minimum Cost Flow Network Problems, Management Sciences, vol. 20, 1974, p. 814-821. [MR: 329614] [Zbl: 0303.90042] [Google Scholar]
  • 15. C. L. MONNA et M. SEGAL, Primal Algorithm for Finding Minimum Cost Flow in Capacited Networks with Applications, Bell System Technical Journal, vol. 61, 1982, p. 949-968. [MR: 665450] [Google Scholar]
  • 16. J. M. MULVEY, Testing of Large-Scale Network Optimization Program, Mathematical Programming, vol. 15, 1978, p. 291-314. [MR: 1552875] [Zbl: 0389.65032] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.