Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks (Q833589)

From MaRDI portal
Revision as of 21:50, 1 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks
scientific article

    Statements

    Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks (English)
    0 references
    0 references
    0 references
    0 references
    14 August 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    project management
    0 references
    time-cost tradeoff
    0 references
    approximation algorithms
    0 references
    0 references