Variable Sized Bin Packing
- 1 February 1986
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 15 (1) , 222-230
- https://doi.org/10.1137/0215016
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Fast algorithms for bin packingPublished by Elsevier ,2007
- On a dual version of the one-dimensional bin packing problemJournal of Algorithms, 1984
- A storage-size selection problemInformation Processing Letters, 1984
- Performance of Heuristics for a Computer Resource Allocation ProblemSIAM Journal on Algebraic Discrete Methods, 1984
- Bounds for Multifit Scheduling on Uniform ProcessorsSIAM Journal on Computing, 1983
- An efficient approximation scheme for the one-dimensional bin-packing problemPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- An Introduction to Proof Techniques for Bin-Packing Approximation AlgorithmsPublished by Springer Nature ,1982
- Orthogonal Packings in Two DimensionsSIAM Journal on Computing, 1980
- Worst-Case Performance Bounds for Simple One-Dimensional Packing AlgorithmsSIAM Journal on Computing, 1974
- A Linear Programming Approach to the Cutting-Stock ProblemOperations Research, 1961