Optimization Techniques pp 328-329 | Cite as

Optimal constructions of project networks

Extended abstract

• Authors
• Authors and affiliations

• Maciej M. Sysło

Graphs And Networks

First Online: 29 September 2005

• 1 Citations
• 123 Downloads

Part of the Lecture Notes in Control and Information Sciences book series (LNCIS, volume 23)

This is a preview of subscription content, log in to check access.

References

1. [1]
   M.S. Krishnamoorthy, N. Deo, Complexity of the minimum-dummy-activities problem in a PERT network, Networks 9 (1979), in press.Google Scholar
2. [2]
   M.M. Sysło, Optimal constructions of reversible digraphs, Report Nr N-55, Institute of Computer Science, University of Wrocław, Wrocław 1979.Google Scholar
3. [3]
   M.M. Sysło, Optimal constructions of event-node networks, Report Nr N-61, Institute of Computer Science, University of Wrocław, Wrocław 1979.Google Scholar

Copyright information

© Springer-Verlag 1980

Authors and Affiliations

• Maciej M. Sysło
  • 1

1. 1.Institute of Computer ScienceUniversity of WrocławWrocławPoland