On the minimum dummy-arc problem
David J. Michael; Jerzy Kamburowski
RAIRO - Operations Research - Recherche Opérationnelle (1993)
- Volume: 27, Issue: 2, page 153-168
- ISSN: 0399-0559
Access Full Article
top
How to cite
topMichael, David J., and Kamburowski, Jerzy. "On the minimum dummy-arc problem." RAIRO - Operations Research - Recherche Opérationnelle 27.2 (1993): 153-168. <http://eudml.org/doc/105054>.
@article{Michael1993,
author = {Michael, David J., Kamburowski, Jerzy},
journal = {RAIRO - Operations Research - Recherche Opérationnelle},
keywords = {activity networks; dummy activities; activity on arc; directed acyclic graph; set-covering problem},
language = {eng},
number = {2},
pages = {153-168},
publisher = {EDP-Sciences},
title = {On the minimum dummy-arc problem},
url = {http://eudml.org/doc/105054},
volume = {27},
year = {1993},
}
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
PB - EDP-Sciences
VL - 27
IS - 2
SP - 153
EP - 168
LA - eng
KW - activity networks; dummy activities; activity on arc; directed acyclic graph; set-covering problem
UR - http://eudml.org/doc/105054
ER -
References
top- 1. D. G. CANTOR and B. DIMSDALE, On Direction-Preserving Maps of Graphs, J. Comb. Theory, 1969, 6, pp. 165-176. Zbl0181.51902MR237385
- 2. N. CHRISTOFIDES and S. KORMAN, A Computational Survey of Methods for the Set-Covering Problem, Management Science, 1975, 21, pp. 591-599. Zbl0314.65029MR418913
- 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. Zbl0271.94022
- 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. Zbl0169.20301
- 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. Zbl0414.68018MR546996
- 8. P. MARCHIORO, A. MORGANA, R. PETRESCHI and B. SIMEONE, Adamant Digraphs, Discrete Math., 1988, 69, pp. 253-261. Zbl0648.05023MR940081
- 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. Zbl0551.90094MR776773
- 11. M. MROZEK, Transitively Reduced and Transitively Closed Event Networks, Net-works, 1989, 19, pp. 47-72. Zbl0669.90089MR973564
- 12. F. STERBOUL and D. WERTHEIMER, Comment Construire un Graphe PERT Minimal, R.A.I.R.O. Rech. Oper., 1980, 14, pp. 85-98. Zbl0477.90028MR609477
- 13. J. SPINRAD, The Minimum Dummy Task Problem, Networks, 1986, 16, pp.331-348. Zbl0644.90054MR849951
- 14. M. M. SYSLO, Optimal Constructions of Event-Node Networks, R.A.I.R.O., Rech. Oper., 1981, 15, pp. 241-260. Zbl0464.90078MR637195
- 15. M. M. SYSLO, Optimal Construction of Reversible Digraphs, Discrete Applied Mathematics, 1984, 7, pp. 209-220. Zbl0552.90047
- 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. Zbl0563.05029MR818497
- 17. F. VASKO and G. WILSON, Hybrid Heuristics for the Minimum Cardinality Set Covering Problem, Naval Res. Log. Quart., 1986, 33, pp. 241-249. Zbl0592.90065MR841722
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.