Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks (Q833589): 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 02:20, 5 March 2024

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