An \(n\)-tet graph approach for non-guillotine packings of \(n\)-dimensional boxes into an \(n\)-container
type: Item
instance of: scholarly article
title: An \(n\)-tet graph approach for non-guillotine packings of \(n\)-dimensional boxes into an \(n\)-container
zbMATH Open document ID: 1081.90592
DOI: 10.1016/S0377-2217(02)00135-2
author: Yanyan Li
published in: European Journal of Operational Research
publication date: 2002-11-17T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 1829899
zbMATH Keywords: 3-dimensional packing
zbMATH Keywords: Pallet/container loading
zbMATH Keywords: Combinatorial optimization
zbMATH Keywords: Graph theory
Wikidata QID: Q57719570
MaRDI profile type: Publication
cites work: A systematic approach for the three-dimensional palletization problem
cites work: An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems
cites work: An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
cites work: A comparative evaluation of heuristics for container loading
cites work: Loading Multiple Pallets
cites work: Cutting and packing. Special issue
cites work: An exact depth-first algorithm for the pallet loading problem
cites work: A tabu search algorithm for weakly heterogeneous container loading problems
cites work: An analytical model for the container loading problem
cites work: An exact algorithm for the pallet loading problem
cites work: Some experiments with simulated annealing techniques for packing problems
cites work: Packing problems
cites work: Q4398379
cites work: A Method for Solving Container Packing for a Single Size of Box
cites work: Load planning for shipments of low density products
cites work: A family of genetic algorithms for the pallet loading problem
cites work: Recursive Computational Procedure for Two-dimensional Stock Cutting
cites work: A three-dimensional pallet loading method for single-size boxes
cites work: Q4321918
cites work: An algorithm for the three-dimensional packing problem with asymptotic performance analysis
cites work: An AND/OR-graph approach to the container loading problem
cites work: A simple and effective recursive procedure for the manufacturer's pallet loading problem
cites work: How to use structural constraints to compute an upper bound for the pallet loading problem
cites work: 4-block heuristic for the rectangle packing problem
cites work: The G4-Heuristic for the Pallet Loading Problem
cites work: Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
full work available at URL: s0377-2217(02)00135-2
OpenAlex ID: W2042970314
description: scientific article; zbMATH DE number 1829899