Mrozek, Marian A note on minimum-dummy-activities PERT networks. (English) Zbl 0551.90094 RAIRO, Rech. Oper. 18, 415-421 (1984). In the paper we present a polynomial-time method of verification if solutions to the minimum-dummy-activities problem in PERT networks produced by some suboptimal algorithms are optimal. MSC: 90C35 Programming involving graphs or networks 68Q25 Analysis of algorithms and problem complexity Keywords:polynomial time algorithm; optimality verification method; network construction; network analysis; arc-dual digraph; minimum-dummy- activities problem; PERT networks; suboptimal algorithms PDF BibTeX XML Cite \textit{M. Mrozek}, RAIRO, Rech. Opér. 18, 415--421 (1984; Zbl 0551.90094) Full Text: DOI EuDML OpenURL