Pages that link to "Item:Q506451"
From MaRDI portal
The following pages link to Packing ellipsoids into volume-minimizing rectangular boxes (Q506451):
Displaying 14 items.
- Packing ellipsoids by nonlinear optimization (Q312475) (← links)
- A matheuristic approach with nonlinear subproblems for large-scale packing of ellipsoids (Q1991149) (← links)
- Sparse balanced layout of spherical voids in three-dimensional domains (Q2044059) (← links)
- Packing ovals in optimized regular polygons (Q2173521) (← links)
- Packing ellipsoids in an optimized cylinder (Q2183847) (← links)
- Cutting ellipses from area-minimizing rectangles (Q2250089) (← links)
- Packing ellipses in an optimized convex polygon (Q2274890) (← links)
- Price-and-verify: a new algorithm for recursive circle packing using Dantzig-Wolfe decomposition (Q2288982) (← links)
- Optimized ellipse packings in regular polygons (Q2329677) (← links)
- A nonlinear programming model with implicit variables for packing ellipsoids (Q2399478) (← links)
- Packing circles into perimeter-minimizing convex hulls (Q2423783) (← links)
- Sparse balanced layout of ellipsoids (Q2668514) (← links)
- Packing ellipsoids with overlap (Q2870609) (← links)
- Digital model of natural cores using geometric design (Q6198093) (← links)