Variable neighbourhood search for the variable sized bin packing problem
Authors:
- Vera HemmelmayrVHVera Hemmelmayr
- Verena SchmidVSVerena Schmid
- Christian BlumChristian Blum
- 1 May 2012
- journal article
- research article
- Published by Elsevier in Computers & Operations Research
- Vol. 39 (5) , 1097-1108
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Efficient lower bounds and heuristics for the variable cost and size bin packing problemComputers & Operations Research, 2011
- Heuristics for the variable sized bin-packing problemComputers & Operations Research, 2009
- Relaxations and exact solution of the variable sized bin packing problemComputational Optimization and Applications, 2009
- Solving the variable size bin packing problem with discretized formulationsComputers & Operations Research, 2008
- Accelerating column generation for variable sized bin-packing problemsEuropean Journal of Operational Research, 2007
- Algorithms for the variable sized bin packing problemEuropean Journal of Operational Research, 2003
- Algorithms for packing and scheduling problems4OR, 2003
- A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengthsEuropean Journal of Operational Research, 2002
- Variable neighborhood searchComputers & Operations Research, 1997
- An Efficient Approximation Scheme for Variable-Sized Bin PackingSIAM Journal on Computing, 1987