One-level reformulation of the bilevel Knapsack problem using dynamic programming (Q1941532)

From MaRDI portal
Revision as of 20:03, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
One-level reformulation of the bilevel Knapsack problem using dynamic programming
scientific article

    Statements

    title
    One-level reformulation of the bilevel Knapsack problem using dynamic programming (English)
    0 references
    author
    Luce Brotcorne
    0 references
    Saïd Hanafi
    0 references
    Raïd Mansi
    0 references
    publication date
    13 March 2013
    0 references
    zbMATH Keywords
    bilevel programming
    0 references
    Knapsack problem
    0 references
    dynamic programming
    0 references
    branch-and-bound
    0 references

    Identifiers

    Mathematics Subject Classification ID
    90C27
    0 references
    90C10
    0 references
    90C39
    0 references
    zbMATH DE Number
    6144142
    0 references
    OpenAlex ID
    W2010701510
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1941532&oldid=31671154"
    Powered by MediaWiki