Effective methods for a container packing operation
type: Item
instance of: scholarly article
title: Effective methods for a container packing operation
zbMATH Open document ID: 0881.90048
DOI: 10.1016/S0895-7177(97)00008-3
author: O. Diekmann
published in: Mathematical and Computer Modelling
publication date: 1998-02-19T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 1038632
zbMATH Keywords: 3D-cutting stock
zbMATH Keywords: packing
zbMATH Keywords: transportation
zbMATH Keywords: cargo loading problem
zbMATH Keywords: heuristics
MaRDI profile type: Publication
cites work: Loading plates with non-identical items
cites work: A comparative evaluation of heuristics for container loading
cites work: Q5685847
cites work: Packing problems
cites work: A computer-based heuristic for packing pooled shipment containers
cites work: Multiple Container Packing: A Case Study of Pipe Packing
cites work: A Method for Solving Container Packing for a Single Size of Box
cites work: Packing different-sized circles into a rectangular container
cites work: Multistage Cutting Stock Problems of Two and More Dimensions
cites work: A Linear Programming Approach to the Cutting Stock Problem—Part II
cites work: A Linear Programming Approach to the Cutting-Stock Problem
cites work: A heuristic approach to the three-dimensional cargo-loading problem
cites work: The trim-loss and assortment problems: A survey
cites work: Physical simulation of a three dimensional palletizing heuristic
full work available at URL: s0895-7177(97)00008-3
OpenAlex ID: W1967379091
Wikidata QID: Q128116511
description: scientific article; zbMATH DE number 1038632