Pages that link to "Item:Q312475"

The following pages link to Packing ellipsoids by nonlinear optimization (Q312475):

Displaying 13 items.

• Two approaches to modeling and solving the packing problem for convex polytopes (Q1616253) (← 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)
• Decomposition Algorithm for Irregular Placement Problems (Q5117305) (← links)
• The concept of modeling packing and covering problems using modern computational geometry software (Q6160558) (← links)