Solving container loading problems by block arrangement
type: Item
instance of: scholarly article
title: Solving container loading problems by block arrangement
zbMATH Open document ID: 1081.90610
DOI: 10.1016/S0377-2217(02)00133-9
author: M. Eley
published in: European Journal of Operational Research
publication date: 2002-11-17T00:00:00Z
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 1829895
zbMATH Keywords: Packing
zbMATH Keywords: Container
zbMATH Keywords: Tree search
zbMATH Keywords: Stability
zbMATH Keywords: Weight distribution
MaRDI profile type: Publication
cites work: Loading plates with non-identical items
cites work: Loading Multiple Pallets
cites work: A tabu search algorithm for weakly heterogeneous container loading problems
cites work: A heuristic for multiple container loading problems
cites work: Weight distribution considerations in container loading
cites work: The pilot method: a strategy for heuristic repetition with application to the Steiner problem in graphs
cites work: Q2712383
cites work: A Genetic Algorithm for Solving the Container Loading Problem
cites work: A computer-based heuristic for packing pooled shipment containers
cites work: Recursive Computational Procedure for Two-dimensional Stock Cutting
cites work: An AND/OR-graph approach to the container loading problem
cites work: Applying spatial representation techniques to the container packing problem
cites work: An efficient approach for the multi-pallet loading problem
full work available at URL: s0377-2217(02)00133-9
OpenAlex ID: W2075957730
description: scientific article; zbMATH DE number 1829895