Efficient algorithms for the offline variable sized bin-packing problem

DOI10.1007/s10898-012-9989-xzbMath1286.90132OpenAlexW1975570210MaRDI QIDQ2434654

Abdenour Labed, Mohamed Maiza, Mohammed Said Radjef

Publication date: 6 February 2014

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-012-9989-x

zbMATH Keywords

heuristicsbin-packing problemmonotonicity constraint

Mathematics Subject Classification ID

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

Related Items

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 ⋮ A generalized bin packing problem for parcel delivery in last-mile logistics

Uses Software

• Bison

Cites Work

• Unnamed Item
• Unnamed Item
• Relaxations and exact solution of the variable sized bin packing problem
• A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint
• Heuristics for the variable sized bin-packing problem
• BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
• 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
• Solving the variable size bin packing problem with discretized formulations
• Variable-Sized Bin Packing: Tight Absolute Worst-Case Performance Ratios for Four Approximation Algorithms
• Algorithms for the Constrained Two-Staged Two-Dimensional Cutting Problem
• Heuristics for determining the number of warehouses for storing non-compatible products
• Variable Sized Bin Packing
• An Efficient Approximation Scheme for Variable-Sized Bin Packing
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
• The Loading Problem
• New heuristics for one-dimensional bin-packing