An exact algorithm for the type-constrained and variable sized bin packing problem

DOI10.1007/S10479-009-0557-9zbMATH Open1184.90145OpenAlexW2092288829MaRDI QIDQ2267302FDOQ2267302

Authors: Chun Yang Zhou, Chong Feng Wu, Yun Feng 

Publication date: 1 March 2010

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

Full work available at URL: https://doi.org/10.1007/s10479-009-0557-9

Recommendations

• A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint
• Efficient algorithms for the offline variable sized bin-packing problem
• Relaxations and exact solution of the variable sized bin packing problem
• Heuristics for the variable sized bin-packing problem
• Efficient algorithms for real-life instances of the variable size bin packing problem

zbMATH Keywords

algorithmcombinatorial problemtype-constrained bin packing problem

Mathematics Subject Classification ID

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

Cites Work

• Accelerating column generation for variable sized bin-packing problems
• Exact solution of the two-dimensional finite bin packing problem
• Lower bounds and reduction procedures for the bin packing problem
• Algorithms for packing and scheduling problems. (Abstract of thesis)
• Variable Sized Bin Packing
• An Efficient Approximation Scheme for Variable-Sized Bin Packing
• Variable-sized bin packing: Tight absolute worst-case performance ratios for four approximation algorithms

Cited In (9)

• The solution of packing problems with pieces variable length and additional allocation constraints
• Packing chained items in aligned bins with applications to container transshipment and project scheduling
• Variable neighborhood search for quadratic multiple constraint variable sized bin-packing problem
• Branch-and-price and beam search algorithms for the variable cost and size bin packing problem with optional items
• Principles and Practice of Constraint Programming – CP 2004
• Exact and approximate methods for the score-constrained packing problem
• A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint
• Maximizing the number of mixed packages subject to variety constraints
• The bin packing problem with precedence constraints

Uses Software

• OR-Library

This page was built for publication: An exact algorithm for the type-constrained and variable sized bin packing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2267302)