Comment construire un graphe PERT minimal
RAIRO - Operations Research - Recherche Opérationnelle, Tome 15 (1981) no. 1, pp. 85-98. 
@article{RO_1981__15_1_85_0,
     author = {Sterboul, F. and Wertheimer, D.},
     title = {Comment construire un graphe {PERT} minimal},
     journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
     pages = {85--98},
     publisher = {EDP-Sciences},
     volume = {15},
     number = {1},
     year = {1981},
     mrnumber = {609477},
     zbl = {0477.90028},
     language = {fr},
     url = {http://archive.numdam.org/item/RO_1981__15_1_85_0/}
}
TY  - JOUR
AU  - Sterboul, F.
AU  - Wertheimer, D.
TI  - Comment construire un graphe PERT minimal
JO  - RAIRO - Operations Research - Recherche Opérationnelle
PY  - 1981
SP  - 85
EP  - 98
VL  - 15
IS  - 1
PB  - EDP-Sciences
UR  - http://archive.numdam.org/item/RO_1981__15_1_85_0/
LA  - fr
ID  - RO_1981__15_1_85_0
ER  - 
%0 Journal Article
%A Sterboul, F.
%A Wertheimer, D.
%T Comment construire un graphe PERT minimal
%J RAIRO - Operations Research - Recherche Opérationnelle
%D 1981
%P 85-98
%V 15
%N 1
%I EDP-Sciences
%U http://archive.numdam.org/item/RO_1981__15_1_85_0/
%G fr
%F RO_1981__15_1_85_0
Sterboul, F.; Wertheimer, D. Comment construire un graphe PERT minimal. RAIRO - Operations Research - Recherche Opérationnelle, Tome 15 (1981) no. 1, pp. 85-98. http://archive.numdam.org/item/RO_1981__15_1_85_0/

1. D. G. Malcolm, J. H. Roseboom, C. E. Clark et W. Fazar, Application of a Technique for Research and Development Program Evaluation, Operations Research, vol. 10 n° 6, 1962.

2. C. G. Bigelow, Bibliography ou Project Planning and Control by Network Analysis, Operations Research, vol. 10, n° 5, 1962. | Zbl

3. J. E. Kelley, Critical Path Planning and Scheduling-Mathematical Basis, Operations Research, vol. 9, n° 3, 1961, p. 296-320. | MR | Zbl

4. M. Hayes, The Role of Activity Precedence Relationships in Node-orientated networks, Project Planning by Network Analysis, North-Holland Publishing Company, Amsterdam, 1969, p.128.

5. B. Dimsdale, Computer Construction of Minimal Project Networks, I.B.M. Systems J., vol. 2, mars 1963, p. 24-36.

6. A. C. Fisher, J. S. Liebman et G. L. Nemhauser, Computer Construction of Project Networks, Comm. A.C.M., vol. 11, n° 7, juillet 1968. | Zbl

7. D. G. Cantor et B. Dimsdale, On Direction-Preserving Maps of Graphs, J. Comb. Theor., vol. 6, 1969, p. 165-176. | MR | Zbl

8. M. M. Syslo, Optimal Constructions of Reversible Digraph, preprint. | Zbl

9. B. Roy, Graphes et ordonnancement, Revue française de Recherche opérationnelle, n° 25, 4e trimestre 1962.