Branch-and-price and beam search algorithms for the variable cost and size bin packing problem with optional items

DOI10.1007/s10479-012-1283-2zbMath1303.90085WikidataQ58644318 ScholiaQ58644318MaRDI QIDQ490206

Mauro Maria Baldi, Guido Perboli, Roberto Tadei, Teodor Gabriel Crainic

Publication date: 22 January 2015

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

Full work available at URL: https://doi.org/10.1007/s10479-012-1283-2

zbMATH Keywords

column generation; beam search; branch-and-price; bin packing

Mathematics Subject Classification ID

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90C59: Approximation methods and heuristics in mathematical programming

90C27: Combinatorial optimization

Related Items

On the generalized bin packing problem, Logistics capacity planning: a stochastic bin packing formulation and a progressive hedging meta-heuristic, Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review, A generalized bin packing problem for parcel delivery in last-mile logistics, Variable neighbourhood search for the variable sized bin packing problem, The risk-averse traveling repairman problem with profits

Uses Software

• CPLEX

Cites Work

• 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
• Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem
• A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem
• Heuristics for the variable sized bin-packing problem
• Algorithms for packing and scheduling problems. (Abstract of thesis)
• Variable neighbourhood search for the variable sized bin packing problem
• Recovering beam search: Enhancing the beam search approach for combinatorial optimization problems
• 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
• 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
• Column Generation