An algorithm and efficient data structures for the binary knapsack problem (Q1255893): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0377-2217(78)90137-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2061197582 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Merging and Sorting Applied to the Zero-One Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Enumeration Algorithm for Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3882189 / 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: Q4178782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming Algorithms: A Framework and State-of-the-Art Survey / 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: Mixed-integer Algorithms for the (0,1) Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4062940 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Partitions with Applications to the Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduction Algorithm for Zero-One Single Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4082550 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Algorithm for the 0-1 Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for the generalized assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Algorithms for the 0/1 Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Direct Descent Binary Knapsack Algorithm / rank
 
Normal rank

Latest revision as of 00:47, 13 June 2024

scientific article
Language Label Description Also known as
English
An algorithm and efficient data structures for the binary knapsack problem
scientific article

    Statements

    An algorithm and efficient data structures for the binary knapsack problem (English)
    0 references
    1978
    0 references
    Binary Knapsack Problem
    0 references
    Reduction Scheme
    0 references
    Branch and Bound Algorithm
    0 references
    Boolean Programming
    0 references
    Computational Study
    0 references
    0 references

    Identifiers