A hybrid algorithm for the unbounded knapsack problem (Q1013302): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disopt.2008.09.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2119064613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unbounded knapsack problem: Dynamic programming revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Knapsack Solution Approach by Integer Equivalent Aggregation and Consistency Determination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for the 0-1 multidimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational aspects of hard knapsack problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3780004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5675139 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Theory and Computation of Knapsack Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Mixture of Dynamic Programming and Branch-and-Bound for the Subset-Sum Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3678962 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid algorithm for the unbounded knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On dominated terms in the general knapsack problem / rank
 
Normal rank

Latest revision as of 12:25, 1 July 2024

scientific article
Language Label Description Also known as
English
A hybrid algorithm for the unbounded knapsack problem
scientific article

    Statements

    A hybrid algorithm for the unbounded knapsack problem (English)
    0 references
    0 references
    0 references
    0 references
    17 April 2009
    0 references
    0 references
    branch and bound
    0 references
    dynamic programming
    0 references
    algorithm engineering
    0 references
    0 references
    0 references
    0 references
    0 references