Pages that link to "Item:Q2448172"
From MaRDI portal
The following pages link to Packing unequal circles into a strip of minimal length with a jump algorithm (Q2448172):
Displaying 13 items.
- 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)
- Quasi-human seniority-order algorithm for unequal circles packing (Q528450) (← links)
- The method of artificial space dilation in problems of optimal packing of geometric objects (Q681723) (← links)
- A memetic algorithm to pack unequal circles into a square (Q1651582) (← links)
- Optimized packing multidimensional hyperspheres: a unified approach (Q1979535) (← links)
- Iterated dynamic thresholding search for packing equal circles into a circular container (Q2077968) (← links)
- Wildfire burn scar encapsulation. Subsetting common spatial domains for post-wildfire debris flow predictions over the United States (Q2119735) (← links)
- A stimulus-response-based allocation method for the circle packing problem with equilibrium constraints (Q2157560) (← links)
- Optimization of 3D objects layout into a multiply connected domain with account for shortest distances (Q2263288) (← links)
- Packing circles into perimeter-minimizing convex hulls (Q2423783) (← links)
- Recursive circle packing problems (Q2803272) (← links)
- Optimal Packing Problems: From Knapsack Problem to Open Dimension Problem (Q5117310) (← links)