- 1 Introduction
- 2 Greedy algorithms for the KP and the SPP with unequal spheres
- 2.1 The methods B1.0 and B1.5 proposed by Huang et al.
- 2.2 Adaptation of basic concepts to the 3D case
- 2.3 Algorithm B1.6_3DKP for the 3D Knapsack Problem
- 2.4 Algorithm B1.6_3DSPP for the Strip Packing Problem
- 2.5 Parallelization of the algorithms
- 3 New benchmark instances
- 4 Experimental results and analysis
- 4.1 Results and analysis for the new benchmark instances
- 4.2 Comparison of methods B1.6_3DSPP and SYS
- 5 Summary
- References
Persistent link: https://www.econbiz.de/10005870648