An \(O(n^2)\) algorithm for lot sizing with inventory bounds and fixed costs (Q943783)

From MaRDI portal
Revision as of 18:56, 7 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
An \(O(n^2)\) algorithm for lot sizing with inventory bounds and fixed costs
scientific article

    Statements

    An \(O(n^2)\) algorithm for lot sizing with inventory bounds and fixed costs (English)
    0 references
    0 references
    0 references
    10 September 2008
    0 references
    0 references
    lot sizing
    0 references
    dynamic programming
    0 references
    extreme points
    0 references