A bound and bound algorithm for the zero-one multiple knapsack problem (Q1155514): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Algorithm 37 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for 0-1 multiple-knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for the Solution of 0-1 Loading Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound for the zero-one knapsack problem and a branch and bound algorithm / 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: Solution of the zero-one multiple knapsack problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:30, 13 June 2024

scientific article
Language Label Description Also known as
English
A bound and bound algorithm for the zero-one multiple knapsack problem
scientific article

    Statements

    A bound and bound algorithm for the zero-one multiple knapsack problem (English)
    0 references
    0 references
    0 references
    1981
    0 references
    bound and bound algorithm
    0 references
    zero-one multiple knapsack problem
    0 references
    tree- search technique
    0 references
    computational results
    0 references
    integer linear programming
    0 references

    Identifiers