Packing of convex polytopes into a parallelepiped
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1786500
- A problem of packing homothetic convex polytopes
- Packing rectangles with congruent polyominoes
- Packing convex bodies by cylinders
- Packing convex polygons in minimum-perimeter convex hulls
- Translational packing of arbitrary polytopes
- Inverse convex programming and parallelepiped packing
- scientific article; zbMATH DE number 3849337
- Parabolic rectangle packings
- Packing and covering tetrahedra
Cites work
- A computer-based heuristic for packing pooled shipment containers
- A Genetic Algorithm for Solving the Container Loading Problem
- A simulated annealing-based algorithm using hierarchical models for general three-dimensional component layout.
- A systematic approach for the three-dimensional palletization problem
- An efficient approach for the multi-pallet loading problem
- Construction of a Φ-function for two convex polytopes
- Heuristics for the container loading problem
- Interactive ILP procedures for stacking optimization for the 3D palletization problem
- Loading plates with non-identical items
- Optimization by simulated annealing
Cited in
(23)- Translational packing of arbitrary polytopes
- Packing cylinders and rectangular parallelepipeds with distances between them into a given region
- Heuristics for container loading of furniture
- Regular packing of congruent polygons on the rectangular sheet
- Inverse convex programming and parallelepiped packing
- Two approaches to modeling and solving the packing problem for convex polytopes
- Packing of concave polyhedra with continuous rotations using nonlinear optimisation
- Extracting maximal objects from three-dimensional solid materials
- The covering of non-convex polytope by a finite family of right parallelepipeds
- The construction of a mathematical model and the solution of the problem of arrangement of convex n-dimensional polytopes in an n-dimensional parallelepiped
- A mathematical model and a method of solution of the problem on packing of interval parallelepipeds
- scientific article; zbMATH DE number 1234829 (Why is no real title available?)
- A problem of packing homothetic convex polytopes
- Geometric Packing under Nonuniform Constraints
- Packing \(n\)-dimensional parallelepipeds with the feasibility of changing their orthogonal orientation in an \(n\)-dimensional parallelepiped
- scientific article; zbMATH DE number 2118573 (Why is no real title available?)
- Mathematical Models of Placement Optimisation: Two- and Three-Dimensional Problems and Applications
- Covering a polygonal region by rectangles
- Mysteries in Packing Regular Tetrahedra
- The caterpillar-packing polytope
- An overview on the use of operations research in additive manufacturing
- Tools of mathematical modeling of arbitrary object packing problems
- Mixed-integer linear programming models for 3D irregular strip packing problems
This page was built for publication: Packing of convex polytopes into a parallelepiped
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4675965)
