New bounds for multidimensional packing

DOI10.1007/s00453-003-1016-7zbMath1045.68160OpenAlexW62983436MaRDI QIDQ1400897

Steven S. Seiden, Rob van Stee

Publication date: 17 August 2003

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://ir.cwi.nl/pub/4279

zbMATH Keywords

Approximation algorithmsBin packingOnline algorithmsBox packing

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Related Items (23)

Models for video-on-demand scheduling with costs ⋮ Packing items to feed assembly lines ⋮ A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems ⋮ An effective tabu search approach with improved loading algorithms for the 3L-CVRP ⋮ Online algorithms for 1-space bounded multidimensional bin packing and hypercube packing ⋮ Dynamic multi-dimensional bin packing ⋮ A note on online hypercube packing ⋮ Drawer algorithms for 1-space bounded multidimensional hyperbox packing ⋮ Efficient 1-space bounded hypercube packing algorithm ⋮ Online removable square packing ⋮ Two-dimensional packing with conflicts ⋮ Online Algorithm for 1-Space Bounded Multi-dimensional Bin Packing ⋮ Online bin packing of squares and cubes ⋮ Bounds for online bounded space hypercube packing ⋮ Lower bounds for three-dimensional multiple-bin-size bin packing problems ⋮ An approximation algorithm for square packing. ⋮ Online bin packing of squares and cubes ⋮ A new upper bound for the online square packing problem in a strip ⋮ Two-dimensional online bin packing with rotation ⋮ Lower bounds for several online variants of bin packing ⋮ Bidimensional packing by bilinear programming ⋮ A lower bound for online rectangle packing ⋮ Online square and cube packing

This page was built for publication: New bounds for multidimensional packing