A dynamic programming algorithm for the bilevel Knapsack problem (Q833584)

From MaRDI portal
Revision as of 20:50, 1 July 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
A dynamic programming algorithm for the bilevel Knapsack problem
scientific article

    Statements

    title
    A dynamic programming algorithm for the bilevel Knapsack problem (English)
    0 references
    author
    Luce Brotcorne
    0 references
    Saïd Hanafi
    0 references
    Raïd Mansi
    0 references
    publication date
    14 August 2009
    0 references
    zbMATH Keywords
    Knapsack problem
    0 references
    bilevel programming
    0 references
    dynamic programming
    0 references
    describes a project that uses
    CPLEX
    0 references
    Knapsack
    0 references

    Identifiers

    zbMATH DE Number
    5595316
    0 references
    OpenAlex ID
    W2072408036
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q833584&oldid=35122894"
    Powered by MediaWiki