| Article ID: | iaor2005488 |
| Country: | Belarus |
| Volume: | 2 |
| Start Page Number: | 107 |
| End Page Number: | 113 |
| Publication Date: | Jun 2004 |
| Journal: | Proceedings of the National Academy of Sciences of Belarus, Series of Physical-Mathematical Sciences |
| Authors: | Sotskov Y.N., Shilak A.N. |
| Keywords: | networks: scheduling |
Efficient algorithms are developed to delete from the given project-network all vertices and all arcs that cannot belong to a critical path for any possible realization of the uncertain activity durations.