Variable Sized Bin Packing
From MaRDI portal
Publication:3718155
DOI10.1137/0215016zbMath0589.68036OpenAlexW2006671706MaRDI QIDQ3718155
Michael A. Langston, Donald K. Friesen
Publication date: 1986
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0215016
Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)
Related Items
On the generalized bin packing problem ⋮ A goal-driven ruin and recreate heuristic for the 2D variable-sized bin packing problem with guillotine constraints ⋮ Variable neighborhood search for quadratic multiple constraint variable sized bin-packing problem ⋮ Bin packing with divisible item sizes ⋮ Packing items to feed assembly lines ⋮ A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems ⋮ Accelerating column generation for variable sized bin-packing problems ⋮ Online variable-sized bin packing ⋮ Worst-case analysis of the FFH algorithm for online variable-sized bin packing ⋮ Bin packing under linear constraints ⋮ A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint ⋮ On-line bin packing ? A restricted survey ⋮ Lower and upper bounding procedures for the bin packing problem with concave loading cost ⋮ Security-aware database migration planning ⋮ A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts ⋮ Vector bin packing with multiple-choice ⋮ 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 ⋮ A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem ⋮ Solving the variable size bin packing problem with discretized formulations ⋮ A new version of on-line variable-sized bin packing ⋮ An improved approximation scheme for variable-sized bin packing ⋮ Knowledge based approach to the cutting stock problem ⋮ Packing problems ⋮ A generalized bin packing problem for parcel delivery in last-mile logistics ⋮ A fast asymptotic approximation scheme for bin packing with rejection ⋮ Relaxations and exact solution of the variable sized bin packing problem ⋮ The freight consolidation and containerization problem ⋮ Variable neighbourhood search for the variable sized bin packing problem ⋮ Lower bounds for three-dimensional multiple-bin-size bin packing problems ⋮ An exact algorithm for the type-constrained and variable sized bin packing problem ⋮ An on-line algorithm for variable-sized bin packing ⋮ Exact solution techniques for two-dimensional cutting and packing ⋮ A bin packing approach to solve the aircraft maintenance task allocation problem ⋮ The vehicle routing problem with heterogeneous locker boxes ⋮ Bin packing with controllable item sizes ⋮ Loading tow trains ergonomically for just-in-time part supply ⋮ Heuristics for the variable sized bin-packing problem ⋮ Resource allocation under limited sharing ⋮ Variable sized online interval coloring with bandwidth ⋮ Cutting optimization with variable-sized stock and inventory status data ⋮ Approximation algorithms for partitioning small items in unequal bins to minimize the total size ⋮ New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems ⋮ Truthful mechanism design for bin packing with applications on cloud computing ⋮ The two-dimensional bin packing problem with variable bin sizes and costs ⋮ A MIP model for freight consolidation in road transportation considering outsourced fleet ⋮ A \(17/10\)-approximation algorithm for \(k\)-bounded space on-line variable-sized bin packing ⋮ The variable-width strip packing problem ⋮ Online Bin Packing with (1,1) and (2,R) Bins ⋮ Algorithms for the variable sized bin packing problem ⋮ Online bin packing with \((1,1)\) and \((2,R)\) bins ⋮ A bin packing problem with over-sized items
