On Three-Dimensional Packing
- 1 October 1990
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 19 (5) , 847-867
- https://doi.org/10.1137/0219059
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Approximation Algorithms for Bin-Packing — An Updated SurveyPublished by Springer Nature ,1984
- Shelf Algorithms for Two-Dimensional Packing ProblemsSIAM Journal on Computing, 1983
- On Packing Two-Dimensional BinsSIAM Journal on Algebraic Discrete Methods, 1982
- A 54 algorithm for two-dimensional packingJournal of Algorithms, 1981
- Orthogonal Packings in Two DimensionsSIAM Journal on Computing, 1980
- Performance Bounds for Level-Oriented Two-Dimensional Packing AlgorithmsSIAM Journal on Computing, 1980
- Resource constrained scheduling as generalized bin packingJournal of Combinatorial Theory, Series A, 1976
- Worst-Case Performance Bounds for Simple One-Dimensional Packing AlgorithmsSIAM Journal on Computing, 1974
- Bounds on Multiprocessing Timing AnomaliesSIAM Journal on Applied Mathematics, 1969
- On packing of squares and cubesJournal of Combinatorial Theory, 1968