A two state reduction based dynamic programming algorithm for the bi-objective \(0\)-\(1\) knapsack problem (Q662206)

From MaRDI portal
Revision as of 08:53, 30 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
A two state reduction based dynamic programming algorithm for the bi-objective \(0\)-\(1\) knapsack problem
scientific article

    Statements

    A two state reduction based dynamic programming algorithm for the bi-objective \(0\)-\(1\) knapsack problem (English)
    0 references
    0 references
    0 references
    0 references
    21 February 2012
    0 references
    bi-objective knapsack instances
    0 references
    multi-objective optimization
    0 references
    dynamic programming
    0 references
    state reduction
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references