Approximation Algorithms for Bin-Packing — An Updated Survey
- 1 January 1984
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 58 references indexed in Scilit:
- On Packing Two-Dimensional BinsSIAM Journal on Algebraic Discrete Methods, 1982
- Lower bounds for on-line two-dimensional packing algorithmsActa Informatica, 1982
- A 54 algorithm for two-dimensional packingJournal of Algorithms, 1981
- A Tight Asymptotic Bound for Next-Fit-Decreasing Bin-PackingSIAM Journal on Algebraic Discrete Methods, 1981
- Orthogonal Packings in Two DimensionsSIAM Journal on Computing, 1980
- An improved BL lower boundInformation Processing Letters, 1980
- Optimal Allocation of Two-Dimensional Irregular Shapes Using Heuristic Search MethodsIEEE Transactions on Systems, Man, and Cybernetics, 1980
- An Algorithm for Two-Dimensional Cutting ProblemsOperations Research, 1977
- Record Allocation for Minimizing Expected Retrieval Costs on Drum-Like Storage DevicesJournal of the ACM, 1976
- Worst-Case Analysis of a Placement Algorithm Related to Storage AllocationSIAM Journal on Computing, 1975