A heuristic routine for solving large loading problems (Q3962774): Difference between revisions

From MaRDI portal
Added link to MaRDI 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.1002/nav.3800260409 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1509898203 / 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 Additive Algorithm for Solving Linear Programs with Zero-One Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete Programming by the Filter Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Loading Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Implicit Enumeration Approach for Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Surrogate Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Surrogate Constraint Duality in Mathematical Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for a class of loading problems / 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

Latest revision as of 16:17, 13 June 2024

scientific article
Language Label Description Also known as
English
A heuristic routine for solving large loading problems
scientific article

    Statements

    A heuristic routine for solving large loading problems (English)
    0 references
    0 references
    0 references
    1979
    0 references
    loading problem
    0 references
    optimal allocation of n objects
    0 references
    m boxes
    0 references
    variable item weights
    0 references
    heuristic procedure
    0 references
    knapsack problem
    0 references
    variable box sizes
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references