Exact methods for three-dimensional cutting and packing: a comparative study concerning single container problems
type: Item
instance of: scholarly article
title: Exact methods for three-dimensional cutting and packing: a comparative study concerning single container problems
zbMATH Open document ID: 1458.90544
author: Everton Fernandes Silva
author: T. Wauters
author: Túlio Ângelo Machado Toffolo
published in: Computers \& Operations Research
publication date: 2019-07-09T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 7077661
zbMATH Keywords: 3D cutting and packing
zbMATH Keywords: exact methods
zbMATH Keywords: comparative study
describes a project that uses: Algorithm 864
describes a project that uses: 2DCPackGen
describes a project that uses: Ts2pack
MaRDI profile type: Publication
full work available at URL: j.cor.2019.04.020
OpenAlex ID: W2942216620
cites work: A space-indexed formulation of packing boxes into a larger box
cites work: A beam search approach to the container loading problem
cites work: Erratum to “The Three-Dimensional Bin Packing Problem”: Robot-Packable and Orthogonal Variants of Packing Problems
cites work: An analytical model for the container loading problem
cites work: TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem
cites work: A MIP-based slicing heuristic for three-dimensional bin packing
cites work: A MIP approach for some practical packing problems: balancing constraints and tetris-like items
cites work: A parallel multi-population biased random-key genetic algorithm for a container loading problem
cites work: An efficient placement heuristic for three-dimensional rectangular packing
cites work: A linear programming approach for the three-dimensional bin-packing problem
cites work: Three-dimensional container loading models with cargo stability and load bearing constraints
cites work: The Three-Dimensional Bin Packing Problem
cites work: Value considerations in three-dimensional packing -- a heuristic procedure using the fractional knapsack problem
cites work: A mixed integer programming formulation for the three-dimensional bin packing problem deriving from an air cargo application
cites work: A maximal-space algorithm for the container loading problem
cites work: 2DCPackGen: a problem generator for two-dimensional rectangular cutting and packing problems
cites work: A two-dimensional heuristic decomposition approach to a three-dimensional multiple container loading problem
cites work: A global optimization approach for solving three-dimensional open dimension rectangular packing problems
cites work: An improved typology of cutting and packing problems
cites work: A comparative review of 3D container loading algorithms
Wikidata QID: Q127960247
DOI: 10.1016/J.COR.2019.04.020
description: scientific article; zbMATH DE number 7077661