Variable neighbourhood search for the variable sized bin packing problem

DOI10.1016/j.cor.2011.07.003zbMath1251.90322OpenAlexW2083558280MaRDI 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 algorithmsvariable neighbourhood searchvariable sized bin packing

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (8)

Variable neighborhood search for quadratic multiple constraint variable sized bin-packing problem ⋮ An iterated greedy algorithm for the planning of yarn‐dyeing boilers ⋮ A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts ⋮ The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers ⋮ Cutting uncertain stock and vehicle routing in a sustainability forestry harvesting problem ⋮ 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

This page was built for publication: Variable neighbourhood search for the variable sized bin packing problem