A lower bound for the non-oriented two-dimensional bin packing problem
- 15 April 2002
- journal article
- Published by Elsevier BV in Discrete Applied Mathematics
- Vol. 118 (1-2), 13-24
- https://doi.org/10.1016/s0166-218x(01)00253-0
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- The Three-Dimensional Bin Packing ProblemOperations Research, 2000
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing ProblemsINFORMS Journal on Computing, 1999
- Exact Solution of the Two-Dimensional Finite Bin Packing ProblemManagement Science, 1998
- Packing problemsEuropean Journal of Operational Research, 1992
- Approximation Algorithms for Maximizing the Number of Squares Packed into a RectangleSIAM Journal on Algebraic Discrete Methods, 1983
- Packing Rectangular Pieces--A Heuristic ApproachThe Computer Journal, 1982