A problem of packing homothetic convex polytopes
From MaRDI portal
Publication:4593129
Recommendations
- Two approaches to modeling and solving the packing problem for convex polytopes
- Construction of a Φ-function for two convex polytopes
- Multistage approach to solving the optimization problem of packing nonconvex polyhedra
- Packing of convex polytopes into a parallelepiped
- Packing congruent spheres into a multi‐connected polyhedral domain
Cited in
(16)- Containment problems for polytopes and spectrahedra
- The construction of a mathematical model and the solution of the problem of arrangement of convex \(n\)-dimensional polytopes in an \(n\)-dimensional parallelepiped
- Polytopes, permutation shapes and bin packing
- scientific article; zbMATH DE number 1122697 (Why is no real title available?)
- Packing of convex polytopes into a parallelepiped
- Inverse convex programming and parallelepiped packing
- Translational packing of arbitrary polytopes
- Embedding of a homothete in a convex compactum: an algorithm and its convergence
- The covering of non-convex polytope by a finite family of right parallelepipeds
- Two approaches to modeling and solving the packing problem for convex polytopes
- Packing of concave polyhedra with continuous rotations using nonlinear optimisation
- A mathematical model and a method of solution of the problem on packing of interval parallelepipeds
- scientific article; zbMATH DE number 1534397 (Why is no real title available?)
- Method of sentinels for packing items within arbitrary convex regions
- Computing maximal copies of polyhedra contained in a polyhedron
- The caterpillar-packing polytope
This page was built for publication: A problem of packing homothetic convex polytopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4593129)
