Geodesic
Flot à coût convexe linéaire par morceaux
RAIRO - Operations Research - Recherche Opérationnelle, Tome 21 (1987) no. 3, pp. 205-217.

Voir la notice de l'article provenant de la source Numdam

@article{RO_1987__21_3_205_0,
     author = {Pasche, C.},
     title = {Flot \`a co\^ut convexe lin\'eaire par morceaux},
     journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
     pages = {205--217},
     publisher = {EDP-Sciences},
     volume = {21},
     number = {3},
     year = {1987},
     mrnumber = {919157},
     zbl = {0623.90017},
     language = {fr},
     url = {http://geodesic.mathdoc.fr/item/RO_1987__21_3_205_0/}
}
TY  - JOUR
AU  - Pasche, C.
TI  - Flot à coût convexe linéaire par morceaux
JO  - RAIRO - Operations Research - Recherche Opérationnelle
PY  - 1987
SP  - 205
EP  - 217
VL  - 21
IS  - 3
PB  - EDP-Sciences
UR  - http://geodesic.mathdoc.fr/item/RO_1987__21_3_205_0/
LA  - fr
ID  - RO_1987__21_3_205_0
ER  - 
%0 Journal Article
%A Pasche, C.
%T Flot à coût convexe linéaire par morceaux
%J RAIRO - Operations Research - Recherche Opérationnelle
%D 1987
%P 205-217
%V 21
%N 3
%I EDP-Sciences
%U http://geodesic.mathdoc.fr/item/RO_1987__21_3_205_0/
%G fr
%F RO_1987__21_3_205_0
Pasche, C. Flot à coût convexe linéaire par morceaux. RAIRO - Operations Research - Recherche Opérationnelle, Tome 21 (1987) no. 3, pp. 205-217. http://geodesic.mathdoc.fr/item/RO_1987__21_3_205_0/

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. | Zbl | MR

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

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

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

5. W. H. Cunningham, A Network Simplex Method, Mathematical Programming, vol. 11, 1976, p. 105-110. | Zbl | MR

6. G. M. Fair et J. C. Geyer, Water Supply and Waste Water Disposal, Wiley, New York, 1954.

7. L. R. Ford et D. R. Fulkerson, Flows in Networks, Princeton, New Jersey, 1962.

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

9.P. L. Hammer et M. Segal, Area Transfers in Local Area (unpublished work).

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. T. C. Hu, Minimum Cost Flow in Convex Cost Network, Naval Res. Logist. Quart, vol. 13, 1966, p. 1-8.

12. P. A. Jensen et J. W. Barnes, Network Flow Programming, Wiley, New York, 1980. | Zbl | MR

13. J. L. Kennington et R. V. Helgason, Algorithms for Network Programming, Wiley, New York, 1980. | Zbl | MR

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. | Zbl | MR

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

16. J. M. Mulvey, Testing of Large-Scale Network Optimization Program, Mathematical Programming, vol. 15, 1978, p. 291-314. | Zbl | MR