%0 Journal Article %1 journals/networks/Syslo84 %A Syslo, Maciej M. %D 1984 %J Networks %K dblp %N 1 %P 37-45 %T On the computational complexity of the minimum-dummy-activities problem in a pert network. %U http://dblp.uni-trier.de/db/journals/networks/networks14.html#Syslo84 %V 14

@article{journals/networks/Syslo84, added-at = {2013-01-23T00:00:00.000+0100}, author = {Syslo, Maciej M.}, biburl = {https://www.bibsonomy.org/bibtex/2ae83386a2dbc2faf5e4bafaf9ff46e20/dblp}, ee = {http://dx.doi.org/10.1002/net.3230140104}, interhash = {ffaedb19f7715ccee6a6aa8d61d9bf56}, intrahash = {ae83386a2dbc2faf5e4bafaf9ff46e20}, journal = {Networks}, keywords = {dblp}, number = 1, pages = {37-45}, timestamp = {2013-01-24T11:35:01.000+0100}, title = {On the computational complexity of the minimum-dummy-activities problem in a pert network.}, url = {http://dblp.uni-trier.de/db/journals/networks/networks14.html#Syslo84}, volume = 14, year = 1984 }