Packing d-Dimensional Bins in d Stages

DOI10.1287/MOOR.1070.0289MaRDI QIDQ5388077zbMATH OpenOpenAlexFDO

Authors Alberto Caprara

Publication date 27 May 2008

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.1070.0289

zbMATH Keywords

\(d\)-dimensional bin packing\(d\)-stage packingapproximation algorithmworst-case analysis

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Linear programming (90C05)

Recommendations

• Approximation schemes for multidimensional packing
• Fast Approximation Schemes for Two-Stage, Two-Dimensional Bin Packing
• An on-line algorithm for multidimensional bin packing
• Multidimensional cube packing
• Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes

Cited in

(7)

• New approximability results for two-dimensional bin packing
• Approximation algorithms for multiple strip packing and scheduling parallel jobs in platforms
• Two for one: tight approximation of 2D bin packing
• Tight approximation algorithms for geometric bin packing with skewed items
• Dynamic multi-dimensional bin packing
• Improved approximation algorithms for three-dimensional knapsack
• Improved approximation algorithms for three-dimensional bin packing

This page was built for publication: Packing d-Dimensional Bins in d Stages

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