Pages that link to "Item:Q2655648"

The following pages link to New and improved results for packing identical unitary radius circles within triangles, rectangles and strips (Q2655648):

Displayed 21 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)
• Polynomial-time approximation schemes for circle and other packing problems (Q329299) ‎ (← links)
• High density packings of equal circles in rectangles with variable aspect ratio (Q339540) ‎ (← links)
• Packing circular-like objects in a rectangular container (Q499146) ‎ (← 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)
• Heuristic-based energy landscape paving for the circular packing problem with performance constraints of equilibrium (Q1618475) ‎ (← links)
• Integer programming formulations for approximate packing circles in a rectangular container (Q1718120) ‎ (← 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)
• Maximizing the sum of radii of balls inscribed in a polyhedral set (Q2272896) ‎ (← links)
• Packing a fixed number of identical circles in a circular container with circular prohibited areas (Q2329665) ‎ (← links)
• Linear models for the approximate solution of the problem of packing equal circles into a given domain (Q2356022) ‎ (← links)
• A nonlinear programming model with implicit variables for packing ellipsoids (Q2399478) ‎ (← links)
• Packing unequal circles into a strip of minimal length with a jump algorithm (Q2448172) ‎ (← links)
• Recursive circle packing problems (Q2803272) ‎ (← links)
• Approximate Packing: Integer Programming Models, Valid Inequalities and Nesting (Q4634978) ‎ (← links)
• Packing circles within ellipses (Q4924059) ‎ (← links)