An empirical analysis of exact algorithms for the unbounded knapsack problem (Q1735169): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
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: An Enumeration Algorithm for Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin packing and cutting stock problems: mathematical models and exact algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: BPPLIB: a library for bin packing and cutting stock problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5675139 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Programming Approach to the Cutting-Stock Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Programming Approach to the Cutting Stock Problem—Part II / 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: On equivalent knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A better step-off algorithm for the knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual Inequalities for Stabilized Column Generation Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5595961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Unbounded Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4149228 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for large unbounded knapsack problems / 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: A Finite Renewal Algorithm for the Knapsack and Turnpike Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: On dominated terms in the general knapsack problem / rank
 
Normal rank

Revision as of 23:00, 18 July 2024

scientific article
Language Label Description Also known as
English
An empirical analysis of exact algorithms for the unbounded knapsack problem
scientific article

    Statements

    An empirical analysis of exact algorithms for the unbounded knapsack problem (English)
    0 references
    0 references
    0 references
    28 March 2019
    0 references
    combinatorial optimization
    0 references
    unbounded knapsack problem
    0 references
    dynamic programming
    0 references
    integer programming
    0 references
    branch and bound
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references