Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks (Q4367255)

From MaRDI portal
Revision as of 15:40, 28 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1091537
Language Label Description Also known as
English
Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks
scientific article; zbMATH DE number 1091537

    Statements

    Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    25 November 1997
    0 references
    time-cost tradeoff
    0 references
    project networks
    0 references
    exponential worst-case complexity
    0 references
    strongly NP-hard
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references