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

From MaRDI portal
Added link to MaRDI item.
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 17:49, 5 March 2024

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