Relaxations and exact solution of the variable sized bin packing problem

DOI10.1007/s10589-009-9276-zzbMath1219.90141OpenAlexW1977859510MaRDI QIDQ535302

Mehdi Serairi, Mohamed Haouari

Publication date: 11 May 2011

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-009-9276-z

zbMATH Keywords

branch-and-boundlower boundsbin packing problem

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

Variable neighborhood search for quadratic multiple constraint variable sized bin-packing problem ⋮ 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 ⋮ Efficient algorithms for the offline variable sized bin-packing problem ⋮ Branch-and-price and beam search algorithms for the variable cost and size bin packing problem with optional items ⋮ Lower bounds for a bin packing problem with linear usage cost ⋮ A generalized bin packing problem for parcel delivery in last-mile logistics ⋮ The freight consolidation and containerization problem ⋮ Variable neighbourhood search for the variable sized bin packing problem ⋮ Solving bin packing problems using VRPSolver models

Uses Software

• Knapsack

Cites Work

• Unnamed Item
• Unnamed Item
• A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem
• Bin packing with divisible item sizes
• Worst-case analysis of the subset sum algorithm for bin packing.
• Algorithms for packing and scheduling problems. (Abstract of thesis)
• A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths
• A sweep-based algorithm for the fleet size and mix vehicle routing problem
• Algorithms for the variable sized bin packing problem
• Worst-case analysis of the FFH algorithm for online variable-sized bin packing
• An improved lower bound for the bin packing problem
• Solving the variable size bin packing problem with discretized formulations
• The two-dimensional bin packing problem with variable bin sizes and costs
• Accelerating column generation for variable sized bin-packing problems
• Variable-Sized Bin Packing: Tight Absolute Worst-Case Performance Ratios for Four Approximation Algorithms
• A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem
• Tight bounds for the identical parallel machine‐scheduling problem: Part II
• Variable Sized Bin Packing
• An Efficient Approximation Scheme for Variable-Sized Bin Packing