An improved branch and bound algorithm for a strongly correlated unbounded knapsack problem (Q4661050)

From MaRDI portal
Revision as of 00:15, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 2151543
Language Label Description Also known as
English
An improved branch and bound algorithm for a strongly correlated unbounded knapsack problem
scientific article; zbMATH DE number 2151543

    Statements

    An improved branch and bound algorithm for a strongly correlated unbounded knapsack problem (English)
    0 references
    0 references
    0 references
    0 references
    4 April 2005
    0 references
    knapsack problem
    0 references
    branch and bound
    0 references
    combinatorial optimization
    0 references
    exact algorithm
    0 references

    Identifiers