Project scheduling with irregular costs: complexity, approximability, and algorithms (Q707495)

From MaRDI portal
Revision as of 17:11, 4 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Project scheduling with irregular costs: complexity, approximability, and algorithms
scientific article

    Statements

    Project scheduling with irregular costs: complexity, approximability, and algorithms (English)
    0 references
    0 references
    0 references
    9 February 2005
    0 references
    discrete time-cost tradeoff problem
    0 references
    NP-hard
    0 references
    APX-hard
    0 references

    Identifiers