On Three-Dimensional Packing
From MaRDI portal
Publication:3495654
DOI10.1137/0219059zbMath0711.68061OpenAlexW2009489504MaRDI QIDQ3495654
Publication date: 1990
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0219059
Related Items
Value considerations in three-dimensional packing -- a heuristic procedure using the fractional knapsack problem ⋮ Global optimization for the three-dimensional open-dimension rectangular packing problem ⋮ Polynomial-time approximation schemes for circle and other packing problems ⋮ Approximation and online algorithms for multidimensional bin packing: a survey ⋮ Two- and three-dimensional parametric packing ⋮ A hybrid placement strategy for the three-dimensional strip packing problem ⋮ Parametric on-line algorithms for packing rectangles and boxes. ⋮ Two-dimensional strip packing with unloading constraints ⋮ Relations between capacity utilization, minimal bin size and bin number ⋮ An algorithm for the three-dimensional packing problem with asymptotic performance analysis ⋮ SPATIAL SCHEDULING AND WORKFORCE ASSIGNMENT PROBLEM IN BLOCK ASSEMBLY SHOP OF SHIPBUILDING ⋮ Three-dimensional packings with rotations ⋮ Hardness of approximation for orthogonal rectangle packing and covering problems ⋮ Introducing global constraints in CHIP ⋮ AN EFFICIENT JOB SCHEDULING ALGORITHM IN PARTITIONABLE MESH CONNECTED SYSTEMS ⋮ A global optimization algorithm for the three-dimensional packing problem ⋮ Global optimization approach to unequal global optimization approach to unequal sphere packing problems in 3D ⋮ Constraints in container loading -- a state-of-the-art review
