An \(n\)-tet graph approach for non-guillotine packings of \(n\)-dimensional boxes into an \(n\)-container (Q1847196): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: A systematic approach for the three-dimensional palletization problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparative evaluation of heuristics for container loading / rank
 
Normal rank
Property / cites work
 
Property / cites work: Loading Multiple Pallets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting and packing. Special issue / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact depth-first algorithm for the pallet loading problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search algorithm for weakly heterogeneous container loading problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analytical model for the container loading problem / 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: Some experiments with simulated annealing techniques for packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Method for Solving Container Packing for a Single Size of Box / rank
 
Normal rank
Property / cites work
 
Property / cites work: Load planning for shipments of low density products / rank
 
Normal rank
Property / cites work
 
Property / cites work: A family of genetic algorithms for the pallet loading problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive Computational Procedure for Two-dimensional Stock Cutting / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(n\)-tet graph approach for non-guillotine packings of \(n\)-dimensional boxes into an \(n\)-container / rank
 
Normal rank
Property / cites work
 
Property / cites work: A three-dimensional pallet loading method for single-size boxes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4321918 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the three-dimensional packing problem with asymptotic performance analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: An AND/OR-graph approach to the container 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: How to use structural constraints to compute an upper bound for the pallet loading problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: 4-block heuristic for the rectangle packing 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: Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0377-2217(02)00135-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2042970314 / rank
 
Normal rank

Latest revision as of 10:29, 30 July 2024

scientific article
Language Label Description Also known as
English
An \(n\)-tet graph approach for non-guillotine packings of \(n\)-dimensional boxes into an \(n\)-container
scientific article

    Statements

    An \(n\)-tet graph approach for non-guillotine packings of \(n\)-dimensional boxes into an \(n\)-container (English)
    0 references
    0 references
    17 November 2002
    0 references
    3-dimensional packing
    0 references
    Pallet/container loading
    0 references
    Combinatorial optimization
    0 references
    Graph theory
    0 references
    0 references
    0 references
    0 references

    Identifiers