Pages that link to "Item:Q2468491"

The following pages link to Minimizing the object dimensions in circle and sphere packing problems (Q2468491):

Displaying 30 items.

• Packing ellipsoids by nonlinear optimization (Q312475) (← links)
• A formulation space search heuristic for packing unequal circles in a fixed size circular container (Q322624) (← links)
• Packing unequal spheres into various containers (Q334249) (← links)
• Packing congruent hyperspheres into a hypersphere (Q427402) (← links)
• A new semidefinite programming relaxation scheme for a class of quadratic matrix problems (Q453058) (← links)
• Global optimization method for finding dense packings of equal circles in a circle (Q541690) (← links)
• A literature review on circle and sphere packing problems: models and methodologies (Q606170) (← links)
• A heuristic approach for packing identical rectangles in convex regions (Q632680) (← links)
• A heuristic for the circle packing problem with a variety of containers (Q635155) (← links)
• A beam search algorithm for the circular packing problem (Q960400) (← links)
• Solving the problem of packing equal and unequal circles in a circular container (Q969742) (← links)
• Cutting circles and polygons from area-minimizing rectangles (Q1029696) (← links)
• A local search-based method for sphere packing problems (Q1634289) (← links)
• Optimized packing multidimensional hyperspheres: a unified approach (Q1979535) (← links)
• A support tool for planning classrooms considering social distancing between students (Q2065002) (← links)
• Iterated dynamic thresholding search for packing equal circles into a circular container (Q2077968) (← links)
• On the use of third-order models with fourth-order regularization for unconstrained optimization (Q2182770) (← links)
• Packing a fixed number of identical circles in a circular container with circular prohibited areas (Q2329665) (← links)
• Constraints in container loading -- a state-of-the-art review (Q2355797) (← links)
• Dense packing of congruent circles in free-form non-convex containers (Q2357688) (← links)
• A nonlinear programming model with implicit variables for packing ellipsoids (Q2399478) (← links)
• New and improved results for packing identical unitary radius circles within triangles, rectangles and strips (Q2655648) (← links)
• Recursive circle packing problems (Q2803272) (← links)
• Packing Unit Spheres into a Cube Using VNS (Q2840774) (← links)
• Adaptive beam search lookahead algorithms for the circular packing problem (Q3002543) (← links)
• Packing equal circles into a circle with circular prohibited areas (Q4903496) (← links)
• Packing congruent spheres into a multi‐connected polyhedral domain (Q4921255) (← links)
• Packing circles within ellipses (Q4924059) (← links)
• Mathematical Models of Placement Optimisation: Two- and Three-Dimensional Problems and Applications (Q5270075) (← links)
• Iterated dynamic neighborhood search for packing equal circles on a sphere (Q6164321) (← links)