The computational complexity of the criticality problems in a network with interval activity times (Q5953342): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 00:46, 5 March 2024

scientific article; zbMATH DE number 1694119
Language Label Description Also known as
English
The computational complexity of the criticality problems in a network with interval activity times
scientific article; zbMATH DE number 1694119

    Statements

    The computational complexity of the criticality problems in a network with interval activity times (English)
    0 references
    0 references
    0 references
    23 January 2002
    0 references
    0 references
    0 references
    0 references
    0 references
    project management and scheduling
    0 references
    complexity theory
    0 references
    interval criticality
    0 references
    interval CPM
    0 references