Optimal constructions of event-node networks

Maciej M. Syslo

RAIRO - Operations Research - Recherche Opérationnelle (1981)

  • Volume: 15, Issue: 3, page 241-260
  • ISSN: 0399-0559

How to cite

top

Syslo, Maciej M.. "Optimal constructions of event-node networks." RAIRO - Operations Research - Recherche Opérationnelle 15.3 (1981): 241-260. <http://eudml.org/doc/104788>.

@article{Syslo1981,
author = {Syslo, Maciej M.},
journal = {RAIRO - Operations Research - Recherche Opérationnelle},
keywords = {event-node networks; project network; activity networks; event networks; dummy activities; approximate algorithm; line digraph; network construction; polynomial time algorithm; network analysis},
language = {eng},
number = {3},
pages = {241-260},
publisher = {EDP-Sciences},
title = {Optimal constructions of event-node networks},
url = {http://eudml.org/doc/104788},
volume = {15},
year = {1981},
}

TY - JOUR
AU - Syslo, Maciej M.
TI - Optimal constructions of event-node networks
JO - RAIRO - Operations Research - Recherche Opérationnelle
PY - 1981
PB - EDP-Sciences
VL - 15
IS - 3
SP - 241
EP - 260
LA - eng
KW - event-node networks; project network; activity networks; event networks; dummy activities; approximate algorithm; line digraph; network construction; polynomial time algorithm; network analysis
UR - http://eudml.org/doc/104788
ER -

References

top
  1. 1. A. V. AHO, M. R. GAREY and J. D. ULLMAN, The Transitive Reduction of a Directed Graph, S.I.A.M. J. Comput, Vol. 1, 1972, pp. 131-137. Zbl0247.05128MR306032
  2. 2. D. G. CANTOR and B. DIMSDALE, On Direction-Preserving Maps of Graphs,J. Combinatorial Theory, Vol. 6, 1969, pp. 165-176. Zbl0181.51902MR237385
  3. 3. D. G. CORNEIL, C. C. GOTLIEB and Y. M. LEE, Minimal Event-Node Network of Project Precedence Relations, Comm. A.C.M. Vol. 16. 1973, pp. 296-298. Zbl0271.94022
  4. 4. B. DIMSDALE, Computer Construction of Minimal Project Networks, I.B.M. Syst. J., Vol. 2, 1963, pp. 24-36. 
  5. 5. A. C. FISHER, J. S. LIEBMAN and G. L. NEMHAUSER, Computer Construction of Project Networks, Comm, A.C.M., Vol. 11, 1968, pp. 493-497. Zbl0169.20301
  6. 6. F. HARARY and Z. R. NORMAN, Some Properties of Line Digraphs, Rend. Circ. Mat. Palermo, Vol. 9, 1960, pp. 161-168. Zbl0099.18205MR130839
  7. 7. F. HARARY, Graph Theory, Addison-Wesley, Mass., 1969. Zbl0182.57702MR256911
  8. 8. M. HAYES, The Role of Activity Precedence Relationships in Node-Oriented Networks, in : Project Planning by Network Analysis, Proccedings of the Second International Congress, North-Holland Pub. Comp., Amterdam, 1969, pp. 128-146. 
  9. 9. M. S. KRISHNAMOORTHY and N. DEO, Complexity of the Minimum-Dummy-Activities Problem in a PERT Network, Networks, Vol. 9, 1969, pp. 189-194. Zbl0414.68018MR546996
  10. 10. Y. M. LEE, The Minimal Event-Node Network of Project Precedence Relations, M. Sc. Thesis, University of Toronto, Canada, 1971. Zbl0271.94022
  11. 11. F. STERBOUL and D. WERTHEIMER, Comment construire un graphe PERT minimal, Université des Sciences et Techniques de Lille, January 1979. Zbl0477.90028MR597366
  12. 12. M. M. SYSLO, Remarks on Line Digraphs, Bull. Acad. Polon. Sc, Ser. Sc. Math.Astronom. Phys., Vol. 22, 1974, pp. 5-10. Zbl0273.05114MR387111
  13. 13. M. M. SYSLO, Optimal Constructions of Reversible digraphs, Technical Report Nr. N-55, Institute of Computer Science University of Wroclaw, Wroclaw, May 1979. Zbl0552.90047

NotesEmbed ?

top

You 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.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.