A fast algorithm for identifying minimum size instances of the equivalence classes of the pallet loading problem (Q296576): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for the pallet loading problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective recursive partitioning approach for the packing of identical rectangles in a rectangle / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on an <i>L</i>-approach for solving the manufacturer's pallet loading problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraints in container loading -- a state-of-the-art review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical Considerations of the Pallet-Loading Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Three-Dimensional Pallet Chart: An Analysis of the Factors Affecting the Set of Feasible Layouts for a Class of Two-Dimensional Packing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining an upper bound for a class of rectangular packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the pallet loading problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Combined Data-Base and Algorithmic Approach to the Pallet-Loading Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A typology of cutting and packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing stable loads for pallets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of upper bounds for the pallet loading problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An <i>L</i>-approach for packing (<i>ℓ</i>, <i>w</i>)-rectangles into rectangular and <i>L</i>-shaped pieces / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum size instance of a Pallet Loading Problem equivalence class / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the pallet loading problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple and effective recursive procedure for the manufacturer's pallet loading problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some experiments with a simple tabu search algorithm for the manufacturer's pallet loading problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The G4-Heuristic for the Pallet Loading Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved typology of cutting and packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for two-dimensional pallet loading problems of large size / rank
 
Normal rank

Latest revision as of 05:07, 12 July 2024

scientific article
Language Label Description Also known as
English
A fast algorithm for identifying minimum size instances of the equivalence classes of the pallet loading problem
scientific article

    Statements

    A fast algorithm for identifying minimum size instances of the equivalence classes of the pallet loading problem (English)
    0 references
    0 references
    0 references
    23 June 2016
    0 references
    packing
    0 references
    pallet loading problem
    0 references
    equivalence class
    0 references

    Identifiers