Approximation algorithms for the oriented two-dimensional bin packing problem
- 1 January 1999
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 112 (1) , 158-166
- https://doi.org/10.1016/s0377-2217(97)00388-3
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Packing problemsPublished by Elsevier ,2011
- Exact Solution of the Two-Dimensional Finite Bin Packing ProblemManagement Science, 1998
- Cutting and Packing in Production and DistributionPublished by Springer Nature ,1992
- A typology of cutting and packing problemsEuropean Journal of Operational Research, 1990
- Hybrid next-fit algorithm for the two-dimensional rectangle bin-packing problemComputing, 1987
- Two-Dimensional Finite Bin-Packing AlgorithmsJournal of the Operational Research Society, 1987
- Packing Rectangular Pieces--A Heuristic ApproachThe Computer Journal, 1982
- On Packing Two-Dimensional BinsSIAM Journal on Algebraic Discrete Methods, 1982
- An Algorithm for Two-Dimensional Cutting ProblemsOperations Research, 1977
- Worst-Case Performance Bounds for Simple One-Dimensional Packing AlgorithmsSIAM Journal on Computing, 1974