Heuristic algorithms for on-line packing in three dimensions
From MaRDI portal
Publication:4015274
DOI10.1016/0196-6774(92)90058-KzbMath0767.68058MaRDI QIDQ4015274
Publication date: 12 January 1993
Published in: Journal of Algorithms (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (10)
Assigning service requests in voice-over-internet gateway multiprocessors ⋮ Global optimization for the three-dimensional open-dimension rectangular packing problem ⋮ Approximation and online algorithms for multidimensional bin packing: a survey ⋮ A hybrid placement strategy for the three-dimensional strip packing problem ⋮ Parametric on-line algorithms for packing rectangles and boxes. ⋮ An algorithm for the three-dimensional packing problem with asymptotic performance analysis ⋮ Online strip packing with modifiable boxes ⋮ AN EFFICIENT JOB SCHEDULING ALGORITHM IN PARTITIONABLE MESH CONNECTED SYSTEMS ⋮ A global optimization algorithm for the three-dimensional packing problem ⋮ Constraints in container loading -- a state-of-the-art review
This page was built for publication: Heuristic algorithms for on-line packing in three dimensions
