A Method for Solving Container Packing for a Single Size of Box
From MaRDI portal
Publication:4018521
DOI10.1057/jors.1992.45zbMath0825.90719OpenAlexW2036744414MaRDI QIDQ4018521
Publication date: 16 January 1993
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/jors.1992.45
Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
A heuristic algorithm for container loading of pallets with infill boxes, Effective methods for a container packing operation, An improved typology of cutting and packing problems, A three-dimensional bin-packing model: exact multicriteria solution and computational complexity, Analysing trade‐offs in container loading: combining load plan construction heuristics with agent‐based simulation, Three-dimensional container loading models with cargo stability and load bearing constraints, A fast heuristic for a three-dimensional non-convex domain loading problem, A comparative review of 3D container loading algorithms, An \(n\)-tet graph approach for non-guillotine packings of \(n\)-dimensional boxes into an \(n\)-container, 3-D container packing heuristics, Constraints in container loading -- a state-of-the-art review
