Pages that link to "Item:Q2387245"

The following pages link to An effective hybrid algorithm for the problem of packing circles into a larger containing circle (Q2387245):

Displaying 26 items.

• 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)
• Quasi-physical global optimization method for solving the equal circle packing problem (Q350865) (← links)
• A new heuristic algorithm for the circular packing problem with equilibrium constraints (Q350917) (← links)
• Global optimization method for finding dense packings of equal circles in a circle (Q541690) (← links)
• A literature review on circle and sphere packing problems: models and methodologies (Q606170) (← links)
• A heuristic approach for packing identical rectangles in convex regions (Q632680) (← links)
• A hybrid beam search looking-ahead algorithm for the circular packing problem (Q711396) (← links)
• Efficiently packing unequal disks in a circle (Q924882) (← 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)
• Solving the problem of packing equal and unequal circles in a circular container (Q969742) (← 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)
• Adaptive large neighborhood search for solving the circle bin packing problem (Q2027009) (← links)
• Iterated dynamic thresholding search for packing equal circles into a circular container (Q2077968) (← links)
• Evolutionary computation solutions to the circle packing problem (Q2402110) (← links)
• PERM for solving circle packing problem (Q2459405) (← links)
• Adaptive and restarting techniques-based algorithms for circular packing problems (Q2479825) (← links)
• A dynamic adaptive local search algorithm for the circular packing problem (Q2643959) (← links)
• New and improved results for packing identical unitary radius circles within triangles, rectangles and strips (Q2655648) (← links)
• Adaptive beam search lookahead algorithms for the circular packing problem (Q3002543) (← links)
• A new hybrid tabu-simulated annealing heuristic for the dynamic facility layout problem (Q3055216) (← links)
• A model to design recreational boat mooring fields (Q3621925) (← links)
• Approximation schemes for covering and packing problems in image processing and VLSI (Q3771608) (← links)
• A Probability Collectives Approach for Multi-Agent Distributed and Cooperative Optimization with Tolerance for Agent Failure (Q5023088) (← links)