Sterboul, F.; Wertheimer, D. Comment construire un graphe PERT minimal. (French) Zbl 0477.90028 RAIRO, Rech. Opér. 15, 85-98 (1981). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 3 Documents MSC: 90B35 Deterministic scheduling theory in operations research 05C35 Extremal problems in graph theory 65K05 Numerical mathematical programming methods 90C35 Programming involving graphs or networks Keywords:graph construction algorithm; minimal PERT graph; computational efficiency; project scheduling; algorithms PDF BibTeX XML Cite \textit{F. Sterboul} and \textit{D. Wertheimer}, RAIRO, Rech. Opér. 15, 85--98 (1981; Zbl 0477.90028) Full Text: DOI EuDML OpenURL