The two-dimensional bin packing problem with variable bin sizes and costs
- 30 June 2005
- journal article
- Published by Elsevier BV in Discrete Optimization
- Vol. 2 (2), 154-167
- https://doi.org/10.1016/j.disopt.2005.01.002
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- On the two-dimensional Knapsack ProblemOperations Research Letters, 2004
- The Two-Dimensional Finite Bin Packing Problem. Part II: New lower and upper bounds4OR, 2003
- Algorithms for packing and scheduling problems4OR, 2003
- The two-dimensional finite bin packing problem. Part I: New lower bounds for the oriented case4OR, 2003
- A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengthsEuropean Journal of Operational Research, 2002
- A lower bound for the non-oriented two-dimensional bin packing problemDiscrete Applied Mathematics, 2002
- On-line packing and covering problemsLecture Notes in Computer Science, 1998
- An expanding-core algorithm for the exact 0–1 knapsack problemEuropean Journal of Operational Research, 1995
- An analytical model for the container loading problemEuropean Journal of Operational Research, 1995
- Two-Dimensional Finite Bin-Packing AlgorithmsJournal of the Operational Research Society, 1987