Variable neighbourhood search for the variable sized bin packing problem

DOI10.1016/j.cor.2011.07.003zbMath1251.90322MaRDI QIDQ1762087

Verena Schmid, Christian Blum, Vera C. Hemmelmayr

Publication date: 15 November 2012

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2011.07.003

zbMATH Keywords

hybrid algorithms; variable neighbourhood search; variable sized bin packing

Mathematics Subject Classification ID

90C59: Approximation methods and heuristics in mathematical programming

90C27: Combinatorial optimization

Related Items

Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems, Branch-and-price and beam search algorithms for the variable cost and size bin packing problem with optional items, A generalized bin packing problem for parcel delivery in last-mile logistics

Cites Work

• Unnamed Item
• Branch-and-price and beam search algorithms for the variable cost and size bin packing problem with optional items
• Relaxations and exact solution of the variable sized bin packing problem
• Heuristics for the variable sized bin-packing problem
• Variable neighborhood search
• Algorithms for packing and scheduling problems. (Abstract of thesis)
• A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths
• Algorithms for the variable sized bin packing problem
• Hybrid metaheuristics. 7th international workshop, HM 2010, Vienna, Austria, October 1--2, 2010. Proceedings
• Solving the variable size bin packing problem with discretized formulations
• Accelerating column generation for variable sized bin-packing problems
• Variable-Sized Bin Packing: Tight Absolute Worst-Case Performance Ratios for Four Approximation Algorithms
• Variable Sized Bin Packing
• An Efficient Approximation Scheme for Variable-Sized Bin Packing