Lower bounds for three-dimensional multiple-bin-size bin packing problems
- 1 October 2013
- journal article
- research article
- Published by Springer Science and Business Media LLC in OR Spectrum
- Vol. 37 (1), 49-74
- https://doi.org/10.1007/s00291-013-0347-2
Abstract
No abstract availableKeywords
This publication has 29 references indexed in Scilit:
- A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock sizeEuropean Journal of Operational Research, 2012
- Efficient lower bounds and heuristics for the variable cost and size bin packing problemComputers & Operations Research, 2011
- Solving the variable size bin packing problem with discretized formulationsComputers & Operations Research, 2008
- A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problemComputers & Operations Research, 2008
- An improved typology of cutting and packing problemsEuropean Journal of Operational Research, 2007
- The two-dimensional bin packing problem with variable bin sizes and costsDiscrete Optimization, 2005
- Algorithms for packing and scheduling problems4OR, 2003
- The two-dimensional finite bin packing problem. Part I: New lower bounds for the oriented case4OR, 2003
- OR-Library: Distributing Test Problems by Electronic MailJournal of the Operational Research Society, 1990
- Two-Dimensional Finite Bin-Packing AlgorithmsJournal of the Operational Research Society, 1987