An algorithm for the solution of the 0-1 knapsack problem (Q1156694): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: An Algorithm for Large Zero-One Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution of the 0–1 knapsack problem: Comparison of methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3942412 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch Search Algorithm for the Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Approximation Algorithms for Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 37. Algorithm for the solution of the 0-1 single Knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementing Quicksort programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4085490 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Direct Descent Binary Knapsack Algorithm / rank
 
Normal rank

Revision as of 12:47, 13 June 2024

scientific article
Language Label Description Also known as
English
An algorithm for the solution of the 0-1 knapsack problem
scientific article

    Statements

    An algorithm for the solution of the 0-1 knapsack problem (English)
    0 references
    0 references
    0 references
    0 references
    1982
    0 references
    0-1 knapsack problem
    0 references
    implicit enumeration algorithm
    0 references
    FPK 79
    0 references
    implementation
    0 references
    computational results
    0 references
    binary knapsack
    0 references

    Identifiers

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