The Replenishment Schedule to Minimize Peak Storage Problem: The Gap Between the Continuous and Discrete Versions of the Problem (Q5129198)

From MaRDI portal
Revision as of 16:12, 29 July 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q127610561, #quickstatements; #temporary_batch_1722261696779)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7266013
Language Label Description Also known as
English
The Replenishment Schedule to Minimize Peak Storage Problem: The Gap Between the Continuous and Discrete Versions of the Problem
scientific article; zbMATH DE number 7266013

    Statements

    The Replenishment Schedule to Minimize Peak Storage Problem: The Gap Between the Continuous and Discrete Versions of the Problem (English)
    0 references
    0 references
    0 references
    26 October 2020
    0 references
    deterministic inventory theory
    0 references
    complexity
    0 references
    approximation algorithm
    0 references
    weakly NP-hard
    0 references
    integer programming
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references