Variable neighbourhood search for the variable sized bin packing problem
type: Item
instance of: scholarly article
title: Variable neighbourhood search for the variable sized bin packing problem
zbMATH Open document ID: 1251.90322
author: V. Schmid
author: Christian Blum
author: V. C. Hemmelmayr
published in: Computers \& Operations Research
publication date: 2012-11-15T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6107540
zbMATH Keywords: variable sized bin packing
zbMATH Keywords: variable neighbourhood search
zbMATH Keywords: hybrid algorithms
MaRDI profile type: Publication
full work available at URL: j.cor.2011.07.003
OpenAlex ID: W2083558280
cites work: Heuristics for the variable sized bin-packing problem
cites work: Variable Sized Bin Packing
cites work: An Efficient Approximation Scheme for Variable-Sized Bin Packing
cites work: Variable-sized bin packing: Tight absolute worst-case performance ratios for four approximation algorithms
cites work: Algorithms for the variable sized bin packing problem
cites work: Algorithms for packing and scheduling problems. (Abstract of thesis)
cites work: A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths
cites work: Accelerating column generation for variable sized bin-packing problems
cites work: Relaxations and exact solution of the variable sized bin packing problem
cites work: Solving the variable size bin packing problem with discretized formulations
cites work: Branch-and-price and beam search algorithms for the variable cost and size bin packing problem with optional items
cites work: Hybrid metaheuristics. 7th international workshop, HM 2010, Vienna, Austria, October 1--2, 2010. Proceedings
cites work: Variable neighborhood search
cites work: Q4821303
DOI: 10.1016/J.COR.2011.07.003
description: scientific article; zbMATH DE number 6107540