Bin packing: Maximizing the number of pieces packed
From MaRDI portal
Publication:1133327
DOI10.1007/BF00288885zbMath0421.68065MaRDI QIDQ1133327
Joseph Y.-T. Leung, D. W. Ting, Edward G. jun. Coffman
Publication date: 1978
Published in: Acta Informatica (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99) Theory of software (68N99)
Related Items (20)
Integrated production and delivery on parallel batching machines ⋮ Online algorithms with advice for the dual bin packing problem ⋮ Bin packing with divisible item sizes ⋮ Average-case performance analysis of an approximation algorithm for maximum subset sum using recurrence relations ⋮ Minimizing the number of tardy jobs in two-machine settings with common due date ⋮ Bin packing: Maximizing the number of pieces packed ⋮ Approximation Algorithms for Maximizing the Number of Squares Packed into a Rectangle ⋮ Upper bounds and algorithms for the maximum cardinality bin packing problem. ⋮ On maximizing the throughput of multiprocessor tasks. ⋮ A Simple PTAS for the Dual Bin Packing Problem and Advice Complexity of Its Online Version ⋮ Irreducible bin packing and normality in routing open shop ⋮ Performance of Heuristics for a Computer Resource Allocation Problem ⋮ Packing problems ⋮ Lower bounds and algorithms for the minimum cardinality bin covering problem ⋮ Integrated production and delivery scheduling with disjoint windows ⋮ Dual bin packing with items of random sizes ⋮ Probabilistic analysis of a heuristic for the dual bin packing problem ⋮ Bin packing with restricted piece sizes ⋮ Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem ⋮ Analytical loading models in flexible manufacturing systems
Cites Work
This page was built for publication: Bin packing: Maximizing the number of pieces packed
