Pages that link to "Item:Q4675965"
From MaRDI portal
The following pages link to Packing of convex polytopes into a parallelepiped (Q4675965):
Displaying 19 items.
- Packing \(n\)-dimensional parallelepipeds with the feasibility of changing their orthogonal orientation in an \(n\)-dimensional parallelepiped (Q466345) (← links)
- Covering a polygonal region by rectangles (Q538294) (← links)
- Tools of mathematical modeling of arbitrary object packing problems (Q610987) (← links)
- Translational packing of arbitrary polytopes (Q1005325) (← links)
- Packing cylinders and rectangular parallelepipeds with distances between them into a given region (Q1014938) (← links)
- Heuristics for container loading of furniture (Q1044119) (← links)
- Regular packing of congruent polygons on the rectangular sheet (Q1124824) (← links)
- Inverse convex programming and parallelepiped packing (Q1364041) (← links)
- Two approaches to modeling and solving the packing problem for convex polytopes (Q1616253) (← links)
- Packing of concave polyhedra with continuous rotations using nonlinear optimisation (Q1754302) (← links)
- Extracting maximal objects from three-dimensional solid materials (Q2668729) (← links)
- (Q4221568) (← links)
- A problem of packing of homothetic convex polytopes (Q4593129) (← links)
- Geometric Packing under Nonuniform Constraints (Q4593249) (← links)
- (Q4828021) (← links)
- Mathematical Models of Placement Optimisation: Two- and Three-Dimensional Problems and Applications (Q5270075) (← links)
- Mysteries in Packing Regular Tetrahedra (Q5410108) (← links)
- The caterpillar-packing polytope (Q5916056) (← links)
- An overview on the use of operations research in additive manufacturing (Q6099430) (← links)
