A cross entropy algorithm for the Knapsack problem with setups (Q2384601)

From MaRDI portal
Revision as of 07:57, 18 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
A cross entropy algorithm for the Knapsack problem with setups
scientific article

    Statements

    title
    A cross entropy algorithm for the Knapsack problem with setups (English)
    0 references
    author
    Yanyan Li
    0 references
    publication date
    10 October 2007
    0 references
    zbMATH Keywords
    Combinatorial optimization
    0 references
    metaheuristics
    0 references
    Knapsack problem
    0 references
    scheduling
    0 references
    dynamic programming
    0 references
    cross entropy
    0 references

    Identifiers

    zbMATH DE Number
    5199349
    0 references
    OpenAlex ID
    W2099865739
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2384601&oldid=39047674"
    Powered by MediaWiki