Pages that link to "Item:Q1847187"

The following pages link to An improved algorithm for the packing of unequal circles within a larger containing circle (Q1847187):

Displayed 34 items.

• Multi-neighborhood based iterated tabu search for routing and wavelength assignment problem (Q306092) ‎ (← links)
• The disruptive anti-covering location problem (Q320083) ‎ (← 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)
• 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)
• 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)
• 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)
• Split packing: algorithms for packing circles with optimal worst-case density (Q1731458) ‎ (← links)
• Iterated dynamic thresholding search for packing equal circles into a circular container (Q2077968) ‎ (← links)
• Adaptive simulated annealing with greedy search for the circle bin packing problem (Q2147115) ‎ (← links)
• A stimulus-response-based allocation method for the circle packing problem with equilibrium constraints (Q2157560) ‎ (← links)
• Packing a fixed number of identical circles in a circular container with circular prohibited areas (Q2329665) ‎ (← links)
• An effective hybrid algorithm for the problem of packing circles into a larger containing circle (Q2387245) ‎ (← links)
• Evolutionary computation solutions to the circle packing problem (Q2402110) ‎ (← links)
• Adaptive and restarting techniques-based algorithms for circular packing problems (Q2479825) ‎ (← links)
• New heuristics for packing unequal circles into a circular container (Q2489278) ‎ (← links)
• Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization (Q2496055) ‎ (← links)
• A dynamic adaptive local search algorithm for the circular packing problem (Q2643959) ‎ (← links)
• Packing disks into disks with optimal worst-case density (Q2679596) ‎ (← links)
• Adaptive beam search lookahead algorithms for the circular packing problem (Q3002543) ‎ (← 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)
• AN APPROXIMATION ALGORITHM FOR LOCATING MAXIMAL DISKS WITHIN CONVEX POLYGONS (Q4650086) ‎ (← links)
• A Probability Collectives Approach for Multi-Agent Distributed and Cooperative Optimization with Tolerance for Agent Failure (Q5023088) ‎ (← links)
• (Q5088965) ‎ (← links)
• Packing Geometric Objects with Optimal Worst-Case Density (Multimedia Exposition) (Q5088996) ‎ (← links)