Unbounded knapsack problem: Dynamic programming revisited (Q1569945)

From MaRDI portal
Revision as of 10:31, 30 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Unbounded knapsack problem: Dynamic programming revisited
scientific article

    Statements

    title
    Unbounded knapsack problem: Dynamic programming revisited (English)
    0 references
    publication date
    20 September 2000
    0 references
    zbMATH Keywords
    integer programming
    0 references
    dominances
    0 references
    dynamic programming
    0 references
    periodicity
    0 references
    combinatorial optimization
    0 references
    author
    Rumen Andonov
    0 references
    Vincent Poirriez
    0 references
    Sanjay V. Rajopadhye
    0 references

    Identifiers

    Mathematics Subject Classification ID
    90C39
    0 references
    90C27
    0 references
    90C11
    0 references
    zbMATH DE Number
    1471189
    0 references
    Wikidata QID
    Q56050293
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1569945&oldid=34246160"
    Powered by MediaWiki