Variable Sized Bin Packing
From MaRDI portal
Publication:3718155
DOI10.1137/0215016zbMath0589.68036MaRDI 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
68Q25: Analysis of algorithms and problem complexity
68R99: Discrete mathematics in relation to computer science
Related Items
Cutting optimization with variable-sized stock and inventory status data, On-line bin packing ? A restricted survey, An on-line algorithm for variable-sized bin packing, A new version of on-line variable-sized bin packing, Resource allocation under limited sharing, A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem, Bin packing with controllable item sizes, Bin packing with divisible item sizes, Online variable-sized bin packing, Knowledge based approach to the cutting stock problem, Packing problems, Approximation algorithms for partitioning small items in unequal bins to minimize the total size, A \(17/10\)-approximation algorithm for \(k\)-bounded space on-line variable-sized bin packing, A bin packing problem with over-sized items, Algorithms for the variable sized bin packing problem, Worst-case analysis of the FFH algorithm for online variable-sized bin packing, Packing items to feed assembly lines, Solving the variable size bin packing problem with discretized formulations, A fast asymptotic approximation scheme for bin packing with rejection, The two-dimensional bin packing problem with variable bin sizes and costs, Accelerating column generation for variable sized bin-packing problems
