A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint

DOI10.1007/S10479-008-0452-9zbMath1201.90168OpenAlexW2030744036MaRDI QIDQ610980

Alberto Ceselli, Andrea Bettinelli, Giovanni Righini

Publication date: 13 December 2010

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-008-0452-9

zbMATH Keywords

column generationbranch-and-pricebin packing

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (5)

Variable neighborhood search for quadratic multiple constraint variable sized bin-packing problem ⋮ 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 ⋮ A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function ⋮ Random sampling and machine learning to understand good decompositions

Uses Software

• SCIP
• CPLEX
• Knapsack

Cites Work

• Unnamed Item
• A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem
• Anomalous behavior in bin packing algorithms
• 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
• Models and bounds for two-dimensional level packing problems
• Column generation approaches to ship scheduling with flexible cargo sizes
• 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
• A Local-Search-Based Heuristic for the Demand-Constrained Multidimensional Knapsack Problem
• Using Extra Dual Cuts to Accelerate Column Generation
• Variable Sized Bin Packing
• A Minimal Algorithm for the Bounded Knapsack Problem
• A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem
• Ship routing and scheduling with flexible cargo sizes

This page was built for publication: A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint