Solving the problem of packing equal and unequal circles in a circular container

From MaRDI portal
Revision as of 19:25, 30 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:969742

DOI10.1007/s10898-009-9458-3zbMath1190.90161OpenAlexW1965660671MaRDI QIDQ969742

A. R. M. J. U. Jamali, Marco Locatelli, Andrea Grosso, Fabio Schoen

Publication date: 7 May 2010

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-009-9458-3




Related Items (25)

Dense packing of congruent circles in free-form non-convex containersHeuristic-based energy landscape paving for the circular packing problem with performance constraints of equilibriumAdaptive simulated annealing with greedy search for the circle bin packing 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 containerDifferential evolution methods based on local searchesAn action-space-based global optimization algorithm for packing circles into a square containerAn efficient quasi-physical quasi-human algorithm for packing equal circles in a circular containerA memetic algorithm to pack unequal circles into a squareApproximation schemes for covering and packing problems in image processing and VLSIIterated dynamic neighborhood search for packing equal circles on a spherePacking congruent hyperspheres into a hypersphereA heuristic approach for packing identical rectangles in convex regionsA heuristic for the circle packing problem with a variety of containersPacking equal circles into a circle with circular prohibited areasQuasi-human seniority-order algorithm for unequal circles packingOn limits of dense packing of equal spheres in a cubeGlobal optimization method for finding dense packings of equal circles in a circleMaximizing the sum of radii of balls inscribed in a polyhedral setPhase field approach to optimal packing problems and related Cheeger clustersIterated dynamic thresholding search for packing equal circles into a circular containerNon-removable term ergodic action semigroups/groupsContinuous cubic formulations for cluster detection problems in networksGlobal Optimization Approaches for Optimal Trajectory PlanningLinear models for the approximate solution of the problem of packing equal circles into a given domain


Uses Software


Cites Work


This page was built for publication: Solving the problem of packing equal and unequal circles in a circular container