Algorithms for the variable sized bin packing problem
Top Cited Papers
- 13 January 2011
- journal article
- Published by Elsevier
- Vol. 147 (2) , 365-372
- https://doi.org/10.1016/s0377-2217(02)00247-3
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Branch-and-Price Algorithms for the One-Dimensional Cutting Stock ProblemComputational Optimization and Applications, 1998
- Bin packing with divisible item sizesJournal of Complexity, 1987
- An Efficient Approximation Scheme for Variable-Sized Bin PackingSIAM Journal on Computing, 1987
- Variable Sized Bin PackingSIAM Journal on Computing, 1986
- 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