Pages that link to "Item:Q5464427"

The following pages link to Greedy algorithms for packing unequal circles into a rectangular container (Q5464427):

Displaying 29 items.

• A knowledge-based heuristic particle swarm optimization approach with the adjustment strategy for the weighted circle packing problem (Q316266) (← links)
• Iterated tabu search and variable neighborhood descent for packing unequal circles into a circular container (Q322528) (← 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)
• Differential evolution methods based on local searches (Q336908) (← 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)
• 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 local search-based method for sphere packing problems (Q1634289) (← links)
• An efficient quasi-physical quasi-human algorithm for packing equal circles in a circular container (Q1651580) (← links)
• A memetic algorithm to pack unequal circles into a square (Q1651582) (← links)
• A reference length approach for the 3D strip packing problem (Q1926699) (← links)
• Optimized packing multidimensional hyperspheres: a unified approach (Q1979535) (← links)
• Adaptive large neighborhood search for solving the circle bin packing problem (Q2027009) (← links)
• Optimized filling of a given cuboid with spherical powders for additive manufacturing (Q2059194) (← 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)
• Adaptive and restarting techniques-based algorithms for circular packing problems (Q2479825) (← links)
• Recursive circle packing problems (Q2803272) (← 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)