Pages that link to "Item:Q623818"

The following pages link to Parallel greedy algorithms for packing unequal circles into a strip or a rectangle (Q623818):

Displaying 9 items.

• Optimal circle covering problems and their applications (Q302130) (← links)
• A formulation space search heuristic for packing unequal circles in a fixed size circular container (Q322624) (← links)
• An action-space-based global optimization algorithm for packing circles into a square container (Q337511) (← links)
• An anchorage planning strategy with safety and utilization considerations (Q337616) (← links)
• High density packings of equal circles in rectangles with variable aspect ratio (Q339540) (← links)
• A memetic algorithm to pack unequal circles into a square (Q1651582) (← links)
• Packing non-identical circles within a rectangle with open length (Q2392114) (← links)
• Packing unequal circles into a strip of minimal length with a jump algorithm (Q2448172) (← links)
• Recursive circle packing problems (Q2803272) (← links)