On the computational complexity of the minimum-dummy-activities problem in a pert network (Q3332752)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On the computational complexity of the minimum-dummy-activities problem in a pert network
scientific article

    Statements

    On the computational complexity of the minimum-dummy-activities problem in a pert network (English)
    0 references
    0 references
    1984
    0 references
    PERT network
    0 references
    NP-completeness
    0 references
    activity network
    0 references
    event networks
    0 references
    dummy activities
    0 references
    polynomial-time algorithm
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references