A note on minimum-dummy-activities PERT networks (Q3343802)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A note on minimum-dummy-activities PERT networks |
scientific article; zbMATH DE number 3878710
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on minimum-dummy-activities PERT networks |
scientific article; zbMATH DE number 3878710 |
Statements
A note on minimum-dummy-activities PERT networks (English)
0 references
1984
0 references
polynomial time algorithm
0 references
optimality verification method
0 references
network construction
0 references
network analysis
0 references
arc-dual digraph
0 references
minimum-dummy- activities problem
0 references
PERT networks
0 references
suboptimal algorithms
0 references
0 references
0.9156424
0 references
0.8983064
0 references
0.85533303
0 references
0.8490629
0 references
0.84626055
0 references
0.83351487
0 references
