Deterministic Production Planning: Algorithms and Complexity (Q3890384)

From MaRDI portal
Revision as of 13:57, 22 March 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q115188674, #quickstatements; #temporary_batch_1711094041063)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Deterministic Production Planning: Algorithms and Complexity
scientific article

    Statements

    title
    Deterministic Production Planning: Algorithms and Complexity (English)
    0 references
    author
    Michael Florian
    0 references
    Jan Karel Lenstra
    0 references
    publication date
    1980
    0 references
    zbMATH Keywords
    deterministic production planning
    0 references
    finite horizon
    0 references
    minimum total costs
    0 references
    computational complexity
    0 references
    algorithms
    0 references
    NP-hard problems
    0 references

    Identifiers

    DOI
    10.1287/mnsc.26.7.669
    0 references
    Mathematics Subject Classification ID
    90B05
    0 references
    90B30
    0 references
    68Q25
    0 references
    90C39
    0 references
    zbMATH DE Number
    3696795
    0 references
    OpenAlex ID
    W2061538120
    0 references
    Wikidata QID
    Q115188674
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3890384&oldid=33163937"
    Powered by MediaWiki