An effective algorithm for the capacitated single item lot size problem (Q1331619)

From MaRDI portal
Revision as of 17:26, 22 May 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
An effective algorithm for the capacitated single item lot size problem
scientific article

    Statements

    An effective algorithm for the capacitated single item lot size problem (English)
    0 references
    0 references
    0 references
    0 references
    21 August 1994
    0 references
    0 references
    0 references
    0 references
    0 references
    deterministic, single product capacitated dynamic lot size model
    0 references
    growth constraint
    0 references
    dynamic programming
    0 references
    branch-and-bound
    0 references
    NP-hard
    0 references
    0 references
    0 references