scientific article; zbMATH DE number 773158

MaRDI QIDQ4838772zbMATH OpenFDO

Authors Wenqi Huang, Enmin Song, Liang Chen, Yimin Song

Publication date 10 August 1995

zbMATH Keywords

three-dimensional packing problemsuniversal algorithm

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40) Combinatorics in computer science (68R05)

Recommendations

• An algorithm for the three-dimensional packing problem with asymptotic performance analysis
• A general purpose algorithm for three-dimensional packing
• scientific article; zbMATH DE number 994195
• AN EFFICIENT APPROACH FOR THE THREE-DIMENSIONAL CONTAINER PACKING PROBLEM WITH PRACTICAL CONSTRAINTS
• scientific article; zbMATH DE number 5525649
• A global optimization algorithm for the three-dimensional packing problem
• Approximation Algorithms for the Orthogonal Z-Oriented Three-Dimensional Packing Problem
• scientific article; zbMATH DE number 21364
• scientific article; zbMATH DE number 3990764
• An efficient placement heuristic for three-dimensional rectangular packing

Cited in

(9)

• A global optimization algorithm for the three-dimensional packing problem
• Approximating Smallest Containers for Packing Three-Dimensional Convex Objects
• scientific article; zbMATH DE number 5525649 (Why is no real title available?)
• scientific article; zbMATH DE number 3990764 (Why is no real title available?)
• Heuristic algorithms for on-line packing in three dimensions
• scientific article; zbMATH DE number 6861944 (Why is no real title available?)
• Approximation Algorithms for the Orthogonal Z-Oriented Three-Dimensional Packing Problem
• A quasi-human algorithm for solving the three-dimensional rectangular packing problem
• A fast implementation for the 2D/3D box placement problem

This page was built for publication:

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