no. 2
On the minimum dummy-arc problem
RAIRO - Operations Research - Recherche Opérationnelle, Tome 27 (1993) no. 2, pp. 153-168. 
@article{RO_1993__27_2_153_0,
     author = {Michael, David J. and Kamburowski, Jerzy},
     title = {On the minimum dummy-arc problem},
     journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
     pages = {153--168},
     publisher = {EDP-Sciences},
     volume = {27},
     number = {2},
     year = {1993},
     mrnumber = {1222385},
     zbl = {0774.90047},
     language = {en},
     url = {http://archive.numdam.org/item/RO_1993__27_2_153_0/}
}
TY  - JOUR
AU  - Michael, David J.
AU  - Kamburowski, Jerzy
TI  - On the minimum dummy-arc problem
JO  - RAIRO - Operations Research - Recherche Opérationnelle
PY  - 1993
SP  - 153
EP  - 168
VL  - 27
IS  - 2
PB  - EDP-Sciences
UR  - http://archive.numdam.org/item/RO_1993__27_2_153_0/
LA  - en
ID  - RO_1993__27_2_153_0
ER  - 
%0 Journal Article
%A Michael, David J.
%A Kamburowski, Jerzy
%T On the minimum dummy-arc problem
%J RAIRO - Operations Research - Recherche Opérationnelle
%D 1993
%P 153-168
%V 27
%N 2
%I EDP-Sciences
%U http://archive.numdam.org/item/RO_1993__27_2_153_0/
%G en
%F RO_1993__27_2_153_0
Michael, David J.; Kamburowski, Jerzy. On the minimum dummy-arc problem. RAIRO - Operations Research - Recherche Opérationnelle, Tome 27 (1993) no. 2, pp. 153-168. http://archive.numdam.org/item/RO_1993__27_2_153_0/

1. D. G. Cantor and B. Dimsdale, On Direction-Preserving Maps of Graphs, J. Comb. Theory, 1969, 6, pp. 165-176. | MR | Zbl

2. N. Christofides and S. Korman, A Computational Survey of Methods for the Set-Covering Problem, Management Science, 1975, 21, pp. 591-599. | MR | Zbl

3. D. G. Corneil, C.C. Gotlieb and Y. M. Lee, Minimal Event-Node Network of Project Precedence Relation, Comm. A.C.M., 1973, 16, pp. 296-298. | Zbl

4. B. Dimsdale, Computer Construction of Minimal Project Networks, I.B.M. Syst. J., 1963, 2, pp. 24-36.

5. A. C. Fisher, J. S. Liebman and G. L. Nemhauser, Computer Construction of Project Networks, Comm. A.C.M., 1968, 11, pp. 493-497. | Zbl

6. M. Hayes, The Role of Activity Precedence Relations in Node-Oriented Networks, in Project Planning by Network Analysis, North-Holland, Amsterdam, 1969, pp. 128 146.

7. M. S. Krishnamoorthy and N. Deo, Complexity of the Minimum-Dummy-Activities Problem in a PERT Network, Networks, 1979, 9, pp. 189-194. | MR | Zbl

8. P. Marchioro, A. Morgana, R. Petreschi and B. Simeone, Adamant Digraphs, Discrete Math., 1988, 69, pp. 253-261. | MR | Zbl

9. D. J. Michael, Optimal Representation of Activity Networks as Directed Acyclic Graphs, Ph. D. Thesis, 1991, North Carolina State University, Raleigh, NC 27695- 7913.

10. M. Mrozek, A Note on Minimum-Dummy-Activities PERT Networks, R.A.I.R.O. Rech. Oper., 1984, 18, pp. 415-421. | EuDML | Numdam | MR | Zbl

11. M. Mrozek, Transitively Reduced and Transitively Closed Event Networks, Net-works, 1989, 19, pp. 47-72. | MR | Zbl

12. F. Sterboul and D. Wertheimer, Comment Construire un Graphe PERT Minimal, R.A.I.R.O. Rech. Oper., 1980, 14, pp. 85-98. | EuDML | Numdam | MR | Zbl

13. J. Spinrad, The Minimum Dummy Task Problem, Networks, 1986, 16, pp.331-348. | MR | Zbl

14. M. M. Syslo, Optimal Constructions of Event-Node Networks, R.A.I.R.O., Rech. Oper., 1981, 15, pp. 241-260. | EuDML | Numdam | MR | Zbl

15. M. M. Syslo, Optimal Construction of Reversible Digraphs, Discrete Applied Mathematics, 1984, 7, pp. 209-220. | Zbl

16. M. M. Syslo, A Graph-Theoretic Approach to the Jump-Number Problem, in Graphs and Order, I. RIVAL éd., D. Reidel, Dordrecht, 1985, pp. 185-215. | MR | Zbl

17. F. Vasko and G. Wilson, Hybrid Heuristics for the Minimum Cardinality Set Covering Problem, Naval Res. Log. Quart., 1986, 33, pp. 241-249. | MR | Zbl