Packing d-Dimensional Bins in d Stages

DOI10.1287/moor.1070.0289zbMath1161.90389OpenAlexW2112890683MaRDI QIDQ5388077

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

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

Mathematics Subject Classification ID

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

Related Items (7)

Packing anchored rectangles ⋮ APPROXIMATION ALGORITHMS FOR MULTIPLE STRIP PACKING AND SCHEDULING PARALLEL JOBS IN PLATFORMS ⋮ Dynamic multi-dimensional bin packing ⋮ Tight approximation algorithms for geometric bin packing with skewed items ⋮ Online square-into-square packing ⋮ TWO FOR ONE: TIGHT APPROXIMATION OF 2D BIN PACKING ⋮ New approximability results for two-dimensional bin packing

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