On the hardness of evaluating criticality of activities in a planar network with duration intervals (Q1870004)
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: On the hardness of evaluating criticality of activities in a planar network with duration intervals |
scientific article; zbMATH DE number 1903528
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the hardness of evaluating criticality of activities in a planar network with duration intervals |
scientific article; zbMATH DE number 1903528 |
Statements
On the hardness of evaluating criticality of activities in a planar network with duration intervals (English)
0 references
4 May 2003
0 references
Project management and scheduling
0 references
Complexity
0 references
Data intervals
0 references
0 references
0.8955428004264832
0 references
0.8287451267242432
0 references
0.7976540923118591
0 references
0.7819363474845886
0 references
0.7780489921569824
0 references
