Flot à coût convexe linéaire par morceaux

C. Pasche

RAIRO - Operations Research - Recherche Opérationnelle (1987)

  • Volume: 21, Issue: 3, page 205-217
  • ISSN: 0399-0559

How to cite


Pasche, C.. "Flot à coût convexe linéaire par morceaux." RAIRO - Operations Research - Recherche Opérationnelle 21.3 (1987): 205-217. <http://eudml.org/doc/104921>.

author = {Pasche, C.},
journal = {RAIRO - Operations Research - Recherche Opérationnelle},
keywords = {network flow; piecewise linear convex cost function; modified network simplex method},
language = {fre},
number = {3},
pages = {205-217},
publisher = {EDP-Sciences},
title = {Flot à coût convexe linéaire par morceaux},
url = {http://eudml.org/doc/104921},
volume = {21},
year = {1987},

AU - Pasche, C.
TI - Flot à coût convexe linéaire par morceaux
JO - RAIRO - Operations Research - Recherche Opérationnelle
PY - 1987
PB - EDP-Sciences
VL - 21
IS - 3
SP - 205
EP - 217
LA - fre
KW - network flow; piecewise linear convex cost function; modified network simplex method
UR - http://eudml.org/doc/104921
ER -


  1. 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. Zbl0532.90034MR741402
  2. 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. MR514466
  3. 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. Zbl0403.90083
  4. 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. Zbl0373.90079
  5. 5. W. H. CUNNINGHAM, A Network Simplex Method, Mathematical Programming, vol. 11, 1976, p. 105-110. Zbl0352.90039MR462532
  6. 6. G. M. FAIR et J. C. GEYER, Water Supply and Waste Water Disposal, Wiley, New York, 1954. 
  7. 7. L. R. FORD et D. R. FULKERSON, Flows in Networks, Princeton, New Jersey, 1962. Zbl1216.05047
  8. 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. Zbl0282.68020
  9. 9. P. L. HAMMER et M. SEGAL, Area Transfers in Local Area (unpublished work). 
  10. 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. 
  11. 11. T. C. Hu, Minimum Cost Flow in Convex Cost Network, Naval Res. Logist. Quart, vol. 13, 1966, p. 1-8. 
  12. 12. P. A. JENSEN et J. W. BARNES, Network Flow Programming, Wiley, New York, 1980. Zbl0502.90057MR579183
  13. 13. J. L. KENNINGTON et R. V. HELGASON, Algorithms for Network Programming, Wiley, New York, 1980. Zbl0502.90056MR581251
  14. 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. Zbl0303.90042MR329614
  15. 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. MR665450
  16. 16. J. M. MULVEY, Testing of Large-Scale Network Optimization Program, Mathematical Programming, vol. 15, 1978, p. 291-314. Zbl0389.65032MR1552875

NotesEmbed ?


You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.


Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.