A heuristic for multiple container loading problems
type: Item
instance of: scholarly article
title: A heuristic for multiple container loading problems
zbMATH Open document ID: 0967.90007
author: Andreas Bortfeldt
published in: OR Spektrum
publication date: 2001-09-03T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 1470988
zbMATH Keywords: transportation
zbMATH Keywords: container
zbMATH Keywords: container loading problem
zbMATH Keywords: heuristic
zbMATH Keywords: three-dimensional bin packing problem
zbMATH Keywords: three-dimensional multiple knapsack problem
MaRDI profile type: Publication
full work available at URL: s002910050104
OpenAlex ID: W1969084976
DOI: 10.1007/S002910050104
Recommended article: Heuristics for the container loading problem
Recommended article: Solving the single-container loading problem by a fast heuristic method
Recommended article: Heuristics with a new block strategy for the single and multiple containers loading problems
Recommended article: A multi-start random constructive heuristic for the container loading problem
Recommended article: A comparative evaluation of heuristics for container loading
Recommended article: The multiple container loading cost minimization problem
Recommended article: Q3494397
Recommended article: A two-dimensional heuristic decomposition approach to a three-dimensional multiple container loading problem
Recommended article: Approximate algorithms for the container loading problem
description: scientific article; zbMATH DE number 1470988