Pages that link to "Item:Q5464427"
From MaRDI portal
The following pages link to Greedy algorithms for packing unequal circles into a rectangular container (Q5464427):
Displayed 14 items.
- A literature review on circle and sphere packing problems: models and methodologies (Q606170) (← links)
- Parallel greedy algorithms for packing unequal circles into a strip or a rectangle (Q623818) (← links)
- Solving circle packing problems by global optimization: numerical results and industrial applications (Q932199) (← links)
- A beam search algorithm for the circular packing problem (Q960400) (← links)
- Packing cylinders and rectangular parallelepipeds with distances between them into a given region (Q1014938) (← links)
- Column enumeration based decomposition techniques for a class of non-convex MINLP problems (Q1029695) (← links)
- Cutting circles and polygons from area-minimizing rectangles (Q1029696) (← links)
- A reference length approach for the 3D strip packing problem (Q1926699) (← links)
- Packing non-identical circles within a rectangle with open length (Q2392114) (← links)
- Adaptive and restarting techniques-based algorithms for circular packing problems (Q2479825) (← links)
- Adaptive beam search lookahead algorithms for the circular packing problem (Q3002543) (← links)
- Packing identical spheres into a cylinder (Q3002688) (← links)
- GREEDY ALGORITHMS FOR PACKING UNEQUAL SPHERES INTO A CUBOIDAL STRIP OR A CUBOID (Q3114612) (← links)
- A model to design recreational boat mooring fields (Q3621925) (← links)