An improved algorithm for the packing of unequal circles within a larger containing circle

From MaRDI portal
Publication:1847187

DOI10.1016/S0377-2217(01)00241-7zbMath1081.90593MaRDI QIDQ1847187

Huaiqing Wang, Dongming Xu, Quan Zhang, Wenqi Huang

Publication date: 17 November 2002

Published in: European Journal of Operational Research (Search for Journal in Brave)




Related Items (34)

A local search-based method for sphere packing problemsMulti-neighborhood based iterated tabu search for routing and wavelength assignment problemAdaptive simulated annealing with greedy search for the circle bin packing problemThe disruptive anti-covering location problemIterated tabu search and variable neighborhood descent for packing unequal circles into a circular containerA formulation space search heuristic for packing unequal circles in a fixed size circular containerAn effective hybrid algorithm for the problem of packing circles into a larger containing circleA dynamic adaptive local search algorithm for the circular packing problemAn efficient quasi-physical quasi-human algorithm for packing equal circles in a circular containerA memetic algorithm to pack unequal circles into a squareA stimulus-response-based allocation method for the circle packing problem with equilibrium constraintsA new heuristic algorithm for the circular packing problem with equilibrium constraintsEvolutionary computation solutions to the circle packing problemA literature review on circle and sphere packing problems: models and methodologiesPacking disks into disks with optimal worst-case densityApproximation schemes for covering and packing problems in image processing and VLSIA heuristic approach for packing identical rectangles in convex regionsEfficiently packing unequal disks in a circleSolving circle packing problems by global optimization: numerical results and industrial applicationsSplit packing: algorithms for packing circles with optimal worst-case densityAdaptive beam search lookahead algorithms for the circular packing problemAN APPROXIMATION ALGORITHM FOR LOCATING MAXIMAL DISKS WITHIN CONVEX POLYGONSA beam search algorithm for the circular packing problemAdaptive and restarting techniques-based algorithms for circular packing problemsGlobal optimization method for finding dense packings of equal circles in a circleSolving the problem of packing equal and unequal circles in a circular containerNew heuristics for packing unequal circles into a circular containerOrthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimizationUnnamed ItemA model to design recreational boat mooring fieldsPacking Geometric Objects with Optimal Worst-Case Density (Multimedia Exposition)Iterated dynamic thresholding search for packing equal circles into a circular containerPacking a fixed number of identical circles in a circular container with circular prohibited areasA Probability Collectives Approach for Multi-Agent Distributed and Cooperative Optimization with Tolerance for Agent Failure



Cites Work


This page was built for publication: An improved algorithm for the packing of unequal circles within a larger containing circle