Pages that link to "Item:Q312475"
From MaRDI portal
The following pages link to Packing ellipsoids by nonlinear optimization (Q312475):
Displaying 20 items.
- Packing ellipsoids into volume-minimizing rectangular boxes (Q506451) (← links)
- Two approaches to modeling and solving the packing problem for convex polytopes (Q1616253) (← links)
- Optimal packing of general ellipses in a circle (Q1695077) (← links)
- Optimizing the packing of cylinders into a rectangular container: A nonlinear approach (Q1887860) (← links)
- A matheuristic approach with nonlinear subproblems for large-scale packing of ellipsoids (Q1991149) (← links)
- Packing ovals in optimized regular polygons (Q2173521) (← links)
- Packing ellipsoids in an optimized cylinder (Q2183847) (← links)
- Multistage approach to solving the optimization problem of packing nonconvex polyhedra (Q2215293) (← links)
- Packing ellipses in an optimized convex polygon (Q2274890) (← links)
- Optimized packing clusters of objects in a rectangular container (Q2298400) (← links)
- Optimized ellipse packings in regular polygons (Q2329677) (← links)
- A nonlinear programming model with implicit variables for packing ellipsoids (Q2399478) (← links)
- Rigorous packing of unit squares into a circle (Q2416578) (← links)
- Sparse balanced layout of ellipsoids (Q2668514) (← links)
- Packing ellipsoids with overlap (Q2870609) (← links)
- Geometric Packing under Nonuniform Constraints (Q4593249) (← links)
- Decomposition Algorithm for Irregular Placement Problems (Q5117305) (← links)
- Algorithms of optimal ball packing into ellipsoids (Q5134235) (← links)
- The concept of modeling packing and covering problems using modern computational geometry software (Q6160558) (← links)
- Approximation schemes under resource augmentation for knapsack and packing problems of hyperspheres and other shapes (Q6574943) (← links)
