Dynamic Programming to Minimize the Maximum Number of Open Stacks (Q2892372)

From MaRDI portal
Revision as of 03:38, 20 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Dynamic Programming to Minimize the Maximum Number of Open Stacks
scientific article

    Statements

    title
    Dynamic Programming to Minimize the Maximum Number of Open Stacks (English)
    0 references
    publication date
    18 June 2012
    0 references
    zbMATH Keywords
    dynamic programming
    0 references
    minimization of maximum number of open stacks
    0 references
    cutting sequencing
    0 references

    Identifiers

    zbMATH DE Number
    6047477
    0 references
    OpenAlex ID
    W2090776450
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2892372&oldid=39233947"
    Powered by MediaWiki