Efficient algorithms for real-life instances of the variable size bin packing problem

DOI10.1016/j.cor.2012.02.018zbMath1251.90004OpenAlexW2046656503MaRDI QIDQ1761234

Rune Larsen, Jörgen Bang-Jensen

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.2012.02.018

zbMATH Keywords

heuristicscutting stockreal-life applicationvariable size bin packing problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

Related Items (6)

One-dimensional stock cutting: optimization of usable leftovers in consecutive orders ⋮ A Bayesian Monte Carlo method for computing the Shapley value: application to weighted voting and bin packing games ⋮ 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 ⋮ Two-stage two-dimensional guillotine cutting stock problems with usable leftover

Uses Software

• OR-Library
• Knapsack

Cites Work

• Unnamed Item
• A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem
• Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths
• Heuristics for the variable sized bin-packing problem
• The one-dimensional cutting stock problem with usable leftover - a heuristic approach
• Modified subset sum heuristics for bin packing
• Worst-case analysis of the subset sum algorithm for bin packing.
• Linear time-approximation algorithms for bin packing
• A typology of cutting and packing problems
• A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths
• Dynamic programming revisited: Improving knapsack algorithms
• Solving the variable size bin packing problem with discretized formulations
• An improved typology of cutting and packing problems
• A heuristic for the one-dimensional cutting stock problem with usable leftover
• A Linear Programming Approach to the Cutting-Stock Problem
• Integer linear programming for a cutting problem in the wood-processing industry: a case study
• Linear Time Algorithms for Knapsack Problems with Bounded Weights
• New heuristics for one-dimensional bin-packing

This page was built for publication: Efficient algorithms for real-life instances of the variable size bin packing problem