An Efficient Approximation Scheme for Variable-Sized Bin Packing
- 1 February 1987
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 16 (1) , 149-161
- https://doi.org/10.1137/0216012
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Approximation Algorithms for Bin-Packing — An Updated SurveyPublished by Springer Nature ,1984
- An efficient approximation scheme for the one-dimensional bin-packing problemPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- Bin packing can be solved within 1 + ε in linear timeCombinatorica, 1981
- The ellipsoid method and its consequences in combinatorial optimizationCombinatorica, 1981
- A Linear Programming Approach to the Cutting-Stock ProblemOperations Research, 1961
- The Trim ProblemManagement Science, 1957