no. 1
Introduction de dates échues dans l'analyse PERT-coût
RAIRO - Operations Research - Recherche Opérationnelle, Tome 24 (1990) no. 1, pp. 15-27 
@article{RO_1990__24_1_15_0,
     author = {Badran, Fouad},
     title = {Introduction de dates \'echues dans l'analyse {PERT-co\^ut}},
     journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
     pages = {15--27},
     year = {1990},
     publisher = {EDP Sciences},
     volume = {24},
     number = {1},
     mrnumber = {1057137},
     zbl = {0699.90057},
     language = {fr},
     url = {https://www.numdam.org/item/RO_1990__24_1_15_0/}
}
TY  - JOUR
AU  - Badran, Fouad
TI  - Introduction de dates échues dans l'analyse PERT-coût
JO  - RAIRO - Operations Research - Recherche Opérationnelle
PY  - 1990
SP  - 15
EP  - 27
VL  - 24
IS  - 1
PB  - EDP Sciences
UR  - https://www.numdam.org/item/RO_1990__24_1_15_0/
LA  - fr
ID  - RO_1990__24_1_15_0
ER  - 
%0 Journal Article
%A Badran, Fouad
%T Introduction de dates échues dans l'analyse PERT-coût
%J RAIRO - Operations Research - Recherche Opérationnelle
%D 1990
%P 15-27
%V 24
%N 1
%I EDP Sciences
%U https://www.numdam.org/item/RO_1990__24_1_15_0/
%G fr
%F RO_1990__24_1_15_0
Badran, Fouad. Introduction de dates échues dans l'analyse PERT-coût. RAIRO - Operations Research - Recherche Opérationnelle, Tome 24 (1990) no. 1, pp. 15-27. https://www.numdam.org/item/RO_1990__24_1_15_0/

[1] J. Carlier et P. Chretienne, Problèmes d'Ordonnancement : Modélisation/Complexité/Algorithmes, Masson Paris, 1988.

[2] E. A. Dinic, Algorithm for Solution of a Problem of Maximum flow in a Network with Power Estimation, Soviet Math. Dolk., vol. 11, 1970, p. 1277-1280. | Zbl

[3] R. Faure, C. Roucairol et P. Tolla, Chemins et Flots, Ordonnancements, Gauthier-Villars, Paris, 1976. | Zbl | MR

[4] R. Faure, Précis de Recherche Opérationnelle, Dunod, Paris, 1978.

[5] L. R. Ford et D. R. Fulkerson, Maximal Flow Through a Network, Canad. J. Math., vol. 8, 1956, p. 399-404. | Zbl | MR

[6] L. R. Ford et D. R. Fulkerson, Flows in Networks, Princeton Univ. press., 1962. | MR

[7] D. R. Fulkerson, A Network Flow Computation for Project Cost Curves, Management science, vol. 7, 1961, p. 167-178. | Zbl | MR

[8] A. V. Karzanov, Determining the Maximal Flow in a Network by the Method of Preflows, Soviet Math. Dokl., vol 15, 1974, p. 434-437. | Zbl

[9] Roseaux, Graphes : Leurs usages, leurs algorithmes, Masson, tome 1, 1986. | MR

[10] D. D. Sleator et R. E. Tarjan, A Data Structure for Dynamic Tree, J. Comput.System Sri., vol. 24, 1983. | Zbl | MR

[11] D. D. Sleator, An O(nm log n) Algorithm for Maximum Network Flow, Tech. Rep. STANCS-80-831, Computer science Dept., Stanford Univ., 1980.

[12] R. E. Tarjan, Data Structures And Network Algorithms, Wiley, 1983. | Zbl | MR